Results 111 to 120 of about 9,369 (164)
Integer linear programming for contrasting state interventions in Boolean networks. [PDF]
Bampos C, Megalooikonomou V.
europepmc +1 more source
Reducing healthcare access inequities in West Java through forecasting and location-allocation models. [PDF]
Basri MH +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Experiments in mixed-integer linear programming
Mathematical Programming, 1971This paper presents a “branch and bound” method for solving mixed integer linear programming problems. After briefly discussing the bases of the method, new concepts called pseudo-costs and estimations are introduced. Then, the heuristic rules for generating the tree, which are the main features of the method, are presented.
Michel Bénichou +5 more
openaire +2 more sources
Nonlinear and Mixed Integer Linear Programming
2012In this chapter we compare continuous nonlinear optimization with mixed integer optimization of water supply networks by means of a meso scaled network instance. We introduce a heuristic approach, which handles discrete decisions arising in water supply network optimization through penalization using nonlinear programming.
Kolb, Oliver +3 more
openaire +2 more sources
Mixed-Integer Linear Programming Formulations
2014In this chapter, (mixed-)integer linear programming formulations of the resource-constrained project scheduling problem are presented. Standard formulations from the literature and newly proposed formulations are classified according to their size in function of the input data.
Artigues, Christian +3 more
openaire +2 more sources
Safe bounds in linear and mixed-integer linear programming
Mathematical Programming, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arnold Neumaier, Oleg Shcherbina
openaire +4 more sources
The Mixed Integer Linear Bilevel Programming Problem
Operations Research, 1990A two-person, noncooperative game in which the players move in sequence can be modeled as a bilevel optimization problem. In this paper, we examine the case where each player tries to maximize the individual objective function over a jointly constrained polyhedron. The decision variables are variously partitioned into continuous and discrete sets. The
James T. Moore, Jonathan F. Bard
openaire +2 more sources
An optimality cut for mixed integer linear programs
European Journal of Operational Research, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gilbert Laporte, Frédéric Semet
openaire +2 more sources
Multiobjective Integer and Mixed-Integer Linear Programming
2016The introduction of discrete variables into multiobjective programming problems leads to all-integer or mixed-integer problems that are more difficult to tackle, even if they have linear objective functions and constraints. The feasible set is no longer convex, and the additional difficulties go beyond those of changing from single objective linear ...
Carlos Henggeler Antunes +2 more
openaire +1 more source

