Search Results - (("mixed binary linear programming problem") OR ("mixed binary linear programming problems"))

  • Showing 1 - 10 results of 10
Refine Results
  1. 1

    A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems by Fattahi, Ali, Turkay, Metin

    ISSN: 0377-2217, 1872-6860
    Published: Elsevier B.V 16.04.2018
    Published in European journal of operational research (16.04.2018)
    “… the other. For a biobjective mixed-binary linear programming problem (BOMBLP), the NDF consists of some combination of isolated points and open, closed, or half-open/half-closed line segments…”
    Get full text
    Journal Article
  2. 2

    A Strategy to Solve the Multistage Transmission Expansion Planning Problem by Vinasco, G., Rider, M. J., Romero, R.

    ISSN: 0885-8950, 1558-0679
    Published: New York IEEE 01.11.2011
    Published in IEEE transactions on power systems (01.11.2011)
    “…In this letter, a heuristic to reduce the combinatorial search space (CSS) of the multistage transmission expansion planning (MTEP) problem is presented. The…”
    Get full text
    Journal Article
  3. 3

    Lagrangian relaxation for SVM feature selection by Gaudioso, M., Gorgone, E., Labbé, M., Rodríguez-Chía, A.M.

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Published: New York Elsevier Ltd 01.11.2017
    Published in Computers & operations research (01.11.2017)
    “…•Feature selection for SVM is stated as a Mixed Binary Linear Programming problem…”
    Get full text
    Journal Article
  4. 4

    Solving stochastic hydrothermal unit commitment with a new primal recovery technique based on Lagrangian solutions by Reolon Scuzziato, Murilo, Cristian Finardi, Erlon, Frangioni, Antonio

    ISSN: 0142-0615, 1879-3517
    Published: Elsevier Ltd 01.05.2021
    “… This work presents a SHUC model applied in centralized cost-based dispatch. The SHUC is represented by a two-stage stochastic model, formulated as a large-scale mixed-binary linear programming problem…”
    Get full text
    Journal Article
  5. 5

    An interval efficiency analysis with dual-role factors by Toloo, Mehdi, Keshavarz, Esmaeil, Hatami-Marbini, Adel

    ISSN: 0171-6468, 1436-6304
    Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2021
    Published in OR Spectrum (01.03.2021)
    “…Data envelopment analysis (DEA) is a data-driven and benchmarking tool for evaluating the relative efficiency of production units with multiple outputs and…”
    Get full text
    Journal Article
  6. 6

    Strategies to Reduce the Number of Variables and the Combinatorial Search Space of the Multistage Transmission Expansion Planning Problem by Rahmani, Mohsen, Romero, Ruben, Rider, Marcos J.

    ISSN: 0885-8950, 1558-0679
    Published: IEEE 01.08.2013
    Published in IEEE transactions on power systems (01.08.2013)
    “… The multistage TEP problem is modeled like a mixed binary linear programming problem and solved using a commercial solver with a low computational time. The results of one test system and two real systems are presented in order to show the efficiency of the proposed solution technique…”
    Get full text
    Journal Article
  7. 7

    A Framework to Optimize the OFDM-Based Multiuser Dynamic Spectrum Access Networks with Frequency Reuse by Ahmadi, Hamed, Chew, Yong Huat, Chai, Chin Choy

    ISSN: 0929-6212, 1572-834X
    Published: Boston Springer US 01.06.2013
    Published in Wireless personal communications (01.06.2013)
    “…This paper presents a novel framework to optimally solve the spectrum access problem at the central spectrum moderator (CSM) for multiple radio pairs. In the…”
    Get full text
    Journal Article
  8. 8

    Robust Energy Scheduling for Smart Buildings Considering Uncertainty in PV Generation by Foroozandeh, Zahra, Tavares, Ines, Soares, Joao, Ramos, Sergio, Vale, Zita

    Published: IEEE 01.01.2022
    “… A Mixed Binary Linear Programming problem is transformed into a trackable robust counterpart to provide immunity against the worst-case realization…”
    Get full text
    Conference Proceeding
  9. 9

    Finding Most Vital Links over Time in a Flow Network by MOROWATI-SHALILVAND, Shahram, MEHRI-TEKMEH, Javad

    ISSN: 2146-0957, 2146-5703
    Published: Balikesir Balikesir University, Faculty of Engineering Department of Industrial Engineering 01.01.2012
    “… (dynamic maximum flow) up to time horizon T between two terminal nodes. SMVLOT problem is formulated as a mixed binary linear programming problem…”
    Get full text
    Journal Article
  10. 10

    A three‐phase procedure for designing an irrigation system's water distribution network by Gonçalves, Graça Marques, Vaz Pato, Margarida

    ISSN: 0254-5330, 1572-9338
    Published: New York Springer Nature B.V 01.01.2000
    Published in Annals of operations research (01.01.2000)
    “… In the second module, the flows for every arc of this network are calculated. The last one determines the size of the pipes and pumps by solving a mixed binary linear programming problem…”
    Get full text
    Journal Article