Suchergebnisse - linear mixed binary programming problems
-
1
A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems
ISSN: 0377-2217, 1872-6860Veröffentlicht: Elsevier B.V 16.04.2018Veröffentlicht 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 …”
Volltext
Journal Article -
2
A mixed-binary non-linear programming approach for the numerical solution of a family of singular optimal control problems
ISSN: 0020-7179, 1366-5820Veröffentlicht: Abingdon Taylor & Francis 03.07.2019Veröffentlicht in 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 …”
Volltext
Journal Article -
3
A Strategy to Solve the Multistage Transmission Expansion Planning Problem
ISSN: 0885-8950, 1558-0679Veröffentlicht: New York IEEE 01.11.2011Veröffentlicht in 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 …”
Volltext
Journal Article -
4
Multistage Transmission Expansion Planning Considering Fixed Series Compensation Allocation
ISSN: 0885-8950, 1558-0679Veröffentlicht: IEEE 01.11.2013Veröffentlicht in 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 …”
Volltext
Journal Article -
5
An RLT approach for solving the binary-constrained mixed linear complementarity problem
ISSN: 0305-0548, 1873-765X, 0305-0548Veröffentlicht: New York Elsevier Ltd 01.10.2019Veröffentlicht in Computers & operations research (01.10.2019)“… •We give a new way to solve binary-constrained mixed linear complementarity problems …”
Volltext
Journal Article -
6
Development of a new approach for deterministic supply chain network design
ISSN: 0377-2217, 1872-6860Veröffentlicht: Amsterdam Elsevier B.V 01.10.2009Veröffentlicht in European journal of operational research (01.10.2009)“… Consequently, this problem is a binary mixed integer linear programming problem. In this paper, a modified version of Benders …”
Volltext
Journal Article -
7
A Continuous-Time Mixed-Binary Linear Programming Formulation for the Multi-Site Resource-Constrained Project Scheduling Problem
ISSN: 2157-362XVeröffentlicht: IEEE 01.12.2019Veröffentlicht in IEEE International Conference on Industrial Engineering and Engineering Management (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 …”
Volltext
Tagungsbericht -
8
Lagrangian relaxation for SVM feature selection
ISSN: 0305-0548, 1873-765X, 0305-0548Veröffentlicht: New York Elsevier Ltd 01.11.2017Veröffentlicht in Computers & operations research (01.11.2017)“… •Feature selection for SVM is stated as a Mixed Binary Linear Programming problem …”
Volltext
Journal Article -
9
p-Hub approach for the optimal park-and-ride facility location problem
ISSN: 0377-2217, 1872-6860Veröffentlicht: Amsterdam Elsevier B.V 16.04.2013Veröffentlicht in European journal of operational research (16.04.2013)“… We propose a mixed linear programming formulation to determine the location of a fixed number …”
Volltext
Journal Article -
10
Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
ISSN: 0305-0548, 1873-765X, 0305-0548Veröffentlicht: New York Elsevier Ltd 01.07.2012Veröffentlicht in Computers & operations research (01.07.2012)“… We use a mixed binary linear version of the original quadratic problem with constraints represented by a graph …”
Volltext
Journal Article -
11
A comparative study of mixed-integer linear programming and genetic algorithms for solving binary problems
ISBN: 1538657473, 9781538657478Veröffentlicht: IEEE 01.04.2018Veröffentlicht in 2018 5th International Conference on Industrial Engineering and Applications (ICIEA) (01.04.2018)“… This paper aims to investigate the capability of mixed-integer linear programming (MILP …”
Volltext
Tagungsbericht -
12
Robust competitive facility location model with uncertain demand types
ISSN: 1932-6203, 1932-6203Veröffentlicht: San Francisco Public Library of Science 17.08.2022Veröffentlicht in PloS one (17.08.2022)“… This behavior has never been included in competitive facility location problems. Given several other companies …”
Volltext
Journal Article -
13
Solving stochastic hydrothermal unit commitment with a new primal recovery technique based on Lagrangian solutions
ISSN: 0142-0615, 1879-3517Veröffentlicht: Elsevier Ltd 01.05.2021Veröffentlicht in International journal of electrical power & energy systems (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 …”
Volltext
Journal Article -
14
Information-based branching schemes for binary linear mixed integer problems
ISSN: 1867-2949, 1867-2957Veröffentlicht: Berlin/Heidelberg Springer-Verlag 01.12.2009Veröffentlicht in 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 …”
Volltext
Journal Article -
15
Scenario relaxation algorithm for finite scenario-based min–max regret and min–max relative regret robust optimization
ISSN: 0305-0548, 1873-765X, 0305-0548Veröffentlicht: Oxford Elsevier Ltd 01.06.2008Veröffentlicht in 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 …”
Volltext
Journal Article -
16
A Systematic Formulation Tightening Approach for Unit Commitment Problems
ISSN: 0885-8950, 1558-0679Veröffentlicht: New York IEEE 01.01.2020Veröffentlicht in 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 …”
Volltext
Journal Article -
17
A novel mixed binary linear DEA model for ranking decision-making units with preference information
ISSN: 0360-8352, 1879-0550Veröffentlicht: Elsevier Ltd 01.11.2020Veröffentlicht in Computers & industrial engineering (01.11.2020)“… Several mixed binary linear programming models have been proposed in the literature to rank decision-making units (DMUs …”
Volltext
Journal Article -
18
Multi-objective models for crop rotation planning problems
ISSN: 0308-521XVeröffentlicht: Elsevier Ltd 01.08.2024Veröffentlicht in Agricultural systems (01.08.2024)“… (2) Solve the problem using techniques that guarantee optimality. (3) Evaluate the gain in crop diversity versus the net return of the optimized configuration …”
Volltext
Journal Article -
19
A heuristic solution for fuzzy mixed-model line balancing problem
ISSN: 0377-2217, 1872-6860Veröffentlicht: Amsterdam Elsevier B.V 01.02.2006Veröffentlicht in European journal of operational research (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 …”
Volltext
Journal Article -
20
Approximated MILP model for AC transmission expansion planning: global solutions versus local solutions
ISSN: 1751-8687, 1751-8695Veröffentlicht: The Institution of Engineering and Technology 05.05.2016Veröffentlicht in IET generation, transmission & distribution (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 …”
Volltext
Journal Article

