Results 261 to 270 of about 70,247 (289)
Some of the next articles are maybe not open access.

On the mixed integer signomial programming problems

Applied Mathematics and Computation, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Nonlinear and Mixed Integer Linear Programming

2012
In 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 bilinear programming problems

Mathematical Programming, 1993
This paper considers the bilinear programming problem with one set of variables restricted to be binary values. The authors describe some special cases of the problem which admit more efficient solution procedures. A composite Lagrangian relaxation cutting plane algorithm is given for the more general case.
Warren P. Adams, Hanif D. Sherali
openaire   +2 more sources

Cross decomposition for mixed integer programming

Mathematical Programming, 1983
Many methods for solving mixed integer programming problems are based either on primal or on dual decomposition, which yield, respectively, a Benders decomposition algorithm and an implicit enumeration algorithm with bounds computed via Lagrangean relaxation. These methods exploit either the primal or the dual structure of the problem. We propose a new
openaire   +1 more source

Mixed-Integer Linear Programming Formulations

2014
In 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

Mixed-integer programming—1968 and thereafter

Annals of Operations Research, 2007
We present some personal reflections on the developments in integer and mixed-integer programming from 1968 up to around 1980.
openaire   +1 more source

Cuts for Conic Mixed-Integer Programming

2007
A conic integer program is an integer programming problem with conic constraints. Conic integer programming has important applications in finance, engineering, statistical learning, and probabilistic integer programming. Here we study mixed-integer sets defined by second-order conic constraints.
Alper AtamtĂĽrk, Vishnu Narayanan
openaire   +1 more source

A branch-and-cut algorithm for Mixed-Integer Bilinear Programming

European Journal of Operational Research, 2020
Matteo Fischetti, Michele Monaci
exaly  

Minimum Loss Network Reconfiguration Using Mixed-Integer Convex Programming

IEEE Transactions on Power Systems, 2012
Rabih A Jabr   +2 more
exaly  

Home - About - Disclaimer - Privacy