Výsledky vyhľadávania - linear mixed binary programming problem

Upresniť hľadanie
  1. 1

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

    ISSN: 0377-2217, 1872-6860
    Vydavateľské údaje: Elsevier B.V 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…”
    Získať plný text
    Journal Article
  2. 2

    A mixed-binary non-linear programming approach for the numerical solution of a family of singular optimal control problems Autor Foroozandeh, Z., Shamsi, M., de Pinho, M. d. R.

    ISSN: 0020-7179, 1366-5820
    Vydavateľské údaje: Abingdon Taylor & Francis 03.07.2019
    Vydané v International journal of control (03.07.2019)
    “… At first, the SOCP is converted into a binary optimal control problem. Then, by utilising the pseudospectral method, the resulting problem is transcribed to a mixed-binary non-linear programming problem…”
    Získať plný text
    Journal Article
  3. 3

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

    ISSN: 0885-8950, 1558-0679
    Vydavateľské údaje: New York IEEE 01.11.2011
    Vydané v IEEE transactions on power systems (01.11.2011)
    “…) problem is presented. The aim is to solve the MTEP modeled like a mixed binary linear programming (MBLP…”
    Získať plný text
    Journal Article
  4. 4

    Multistage Transmission Expansion Planning Considering Fixed Series Compensation Allocation Autor Rahmani, Mohsen, Vinasco, Guillermo, Rider, Marcos J., Romero, Ruben, Pardalos, Panos M.

    ISSN: 0885-8950, 1558-0679
    Vydavateľské údaje: IEEE 01.11.2013
    Vydané v IEEE transactions on power systems (01.11.2013)
    “… cost compared with planning without FSCs. This problem is modeled as a linear mixed binary programming problem and is solved by a commercial branch-and-cut solver to obtain the optimum solution…”
    Získať plný text
    Journal Article
  5. 5

    An RLT approach for solving the binary-constrained mixed linear complementarity problem Autor Djeumou Fomeni, Franklin, Gabriel, Steven A., Anjos, Miguel F.

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Vydavateľské údaje: New York Elsevier Ltd 01.10.2019
    Vydané v Computers & operations research (01.10.2019)
    “…•We give a new way to solve binary-constrained mixed linear complementarity problems…”
    Získať plný text
    Journal Article
  6. 6

    Development of a new approach for deterministic supply chain network design Autor Mohammadi Bidhandi, Hadi, Mohd. Yusuff, Rosnah, Megat Ahmad, Megat Mohamad Hamdan, Abu Bakar, Mohd Rizam

    ISSN: 0377-2217, 1872-6860
    Vydavateľské údaje: Amsterdam Elsevier B.V 01.10.2009
    “… Consequently, this problem is a binary mixed integer linear programming problem. In this paper, a modified version of Benders…”
    Získať plný text
    Journal Article
  7. 7

    A Continuous-Time Mixed-Binary Linear Programming Formulation for the Multi-Site Resource-Constrained Project Scheduling Problem Autor Gnagi, M., Trautmann, N.

    ISSN: 2157-362X
    Vydavateľské údaje: IEEE 01.12.2019
    “… The problem considered here consists of scheduling a single projects' activities which are interrelated by given precedence relationships of the completion-start type, require various renewable…”
    Získať plný text
    Konferenčný príspevok..
  8. 8

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

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Vydavateľské údaje: New York Elsevier Ltd 01.11.2017
    Vydané v Computers & operations research (01.11.2017)
    “…•Feature selection for SVM is stated as a Mixed Binary Linear Programming problem…”
    Získať plný text
    Journal Article
  9. 9

    p-Hub approach for the optimal park-and-ride facility location problem Autor Aros-Vera, Felipe, Marianov, Vladimir, Mitchell, John E.

    ISSN: 0377-2217, 1872-6860
    Vydavateľské údaje: Amsterdam Elsevier B.V 16.04.2013
    “… We propose a mixed linear programming formulation to determine the location of a fixed number…”
    Získať plný text
    Journal Article
  10. 10

    Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem Autor Mauri, Geraldo Regis, Lorena, Luiz Antonio Nogueira

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Vydavateľské údaje: New York Elsevier Ltd 01.07.2012
    Vydané v Computers & operations research (01.07.2012)
    “… We use a mixed binary linear version of the original quadratic problem with constraints represented by a graph…”
    Získať plný text
    Journal Article
  11. 11

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

    ISSN: 0142-0615, 1879-3517
    Vydavateľské údaje: 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…”
    Získať plný text
    Journal Article
  12. 12

    A comparative study of mixed-integer linear programming and genetic algorithms for solving binary problems Autor Kuendee, Punyisa, Janjarassuk, Udom

    ISBN: 1538657473, 9781538657478
    Vydavateľské údaje: IEEE 01.04.2018
    “…This paper aims to investigate the capability of mixed-integer linear programming (MILP…”
    Získať plný text
    Konferenčný príspevok..
  13. 13

    Robust competitive facility location model with uncertain demand types Autor Yu, Wuyang

    ISSN: 1932-6203, 1932-6203
    Vydavateľské údaje: San Francisco Public Library of Science 17.08.2022
    Vydané v PloS one (17.08.2022)
    “… This behavior has never been included in competitive facility location problems. Given several other companies…”
    Získať plný text
    Journal Article
  14. 14

    A Systematic Formulation Tightening Approach for Unit Commitment Problems Autor Yan, Bing, Luh, Peter B., Zheng, Tongxin, Schiro, Dane A., Bragin, Mikhail A., Zhao, Feng, Zhao, Jinye, Lelic, Izudin

    ISSN: 0885-8950, 1558-0679
    Vydavateľské údaje: New York IEEE 01.01.2020
    Vydané v IEEE transactions on power systems (01.01.2020)
    “…Unit Commitment is usually formulated as a Mixed Binary Linear Programming (MBLP) problem. When considering a large number of units, state-of-the-art methods such as branch-and-cut may experience difficulties…”
    Získať plný text
    Journal Article
  15. 15

    Information-based branching schemes for binary linear mixed integer problems Autor Kılınç Karzan, Fatma, Nemhauser, George L., Savelsbergh, Martin W. P.

    ISSN: 1867-2949, 1867-2957
    Vydavateľské údaje: Berlin/Heidelberg Springer-Verlag 01.12.2009
    Vydané v Mathematical programming computation (01.12.2009)
    “…Branching variable selection can greatly affect the effectiveness and efficiency of a branch-and-bound algorithm. Traditional approaches to branching variable…”
    Získať plný text
    Journal Article
  16. 16

    A heuristic solution for fuzzy mixed-model line balancing problem Autor Hop, Nguyen Van

    ISSN: 0377-2217, 1872-6860
    Vydavateľské údaje: Amsterdam Elsevier B.V 01.02.2006
    “… A fuzzy binary linear programming model is formulated for the problem. This fuzzy model is then transformed to a mixed zero–one program…”
    Získať plný text
    Journal Article
  17. 17

    Scenario relaxation algorithm for finite scenario-based min–max regret and min–max relative regret robust optimization Autor Assavapokee, Tiravat, Realff, Matthew J., Ammons, Jane C., Hong, I-Hsuan

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Vydavateľské údaje: Oxford Elsevier Ltd 01.06.2008
    Vydané v Computers & operations research (01.06.2008)
    “…Most practical decision-making problems are compounded in difficulty by the degree of uncertainty and ambiguity surrounding the key model parameters…”
    Získať plný text
    Journal Article
  18. 18

    A novel mixed binary linear DEA model for ranking decision-making units with preference information Autor Ebrahimi, Bohlool, Tavana, Madjid, Toloo, Mehdi, Charles, Vincent

    ISSN: 0360-8352, 1879-0550
    Vydavateľské údaje: Elsevier Ltd 01.11.2020
    Vydané v Computers & industrial engineering (01.11.2020)
    “… Several mixed binary linear programming models have been proposed in the literature to rank decision-making units (DMUs…”
    Získať plný text
    Journal Article
  19. 19

    Approximated MILP model for AC transmission expansion planning: global solutions versus local solutions Autor Akbari, Tohid, Tavakoli Bina, Mohammad

    ISSN: 1751-8687, 1751-8695
    Vydavateľské údaje: The Institution of Engineering and Technology 05.05.2016
    “… While the AC-TEP is inherently a mixed-integer non-linear programming problem, this can be transformed into a mixed-integer linear programming framework by the proposed model which is based upon…”
    Získať plný text
    Journal Article
  20. 20

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

    ISSN: 0929-6212, 1572-834X
    Vydavateľské údaje: Boston Springer US 01.06.2013
    Vydané v 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…”
    Získať plný text
    Journal Article