Sciweavers

210 search results - page 1 / 42
» Error bounds for mixed integer linear optimization problems
Sort
View
MOC
2000
83views more  MOC 2000»
13 years 4 months ago
On the problem of spurious eigenvalues in the approximation of linear elliptic problems in mixed form
In the approximation of linear elliptic operators in mixed form, it is well known that the so-called inf-sup and ellipticity in the kernel properties are sufficient (and, in a sens...
Daniele Boffi, Franco Brezzi, Lucia Gastaldi
CP
2005
Springer
13 years 10 months ago
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
ENDM
2010
115views more  ENDM 2010»
13 years 1 months ago
On the knapsack closure of 0-1 Integer Linear Programs
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
Matteo Fischetti, Andrea Lodi
CP
2003
Springer
13 years 9 months ago
Constraint-Based Optimization with the Minimax Decision Criterion
Abstract. In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which users have preferences. We consider the problem of...
Craig Boutilier, Relu Patrascu, Pascal Poupart, Da...
DISOPT
2008
138views more  DISOPT 2008»
13 years 4 months ago
An algorithmic framework for convex mixed integer nonlinear programs
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, ...