Sciweavers

DISOPT
2007
79views more  DISOPT 2007»
13 years 6 months ago
Improving the feasibility pump
Tobias Achterberg, Timo Berthold
DISOPT
2007
155views more  DISOPT 2007»
13 years 6 months ago
Linear-programming design and analysis of fast algorithms for Max 2-CSP
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
Alexander D. Scott, Gregory B. Sorkin
DISOPT
2007
77views more  DISOPT 2007»
13 years 6 months ago
Computing integral solutions of complementarity problems
Gerard van der Laan, Dolf Talman, Zaifu Yang
DISOPT
2007
81views more  DISOPT 2007»
13 years 6 months ago
Strong polynomiality of resource constraint propagation
Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation....
Luc Mercier, Pascal Van Hentenryck
DISOPT
2007
94views more  DISOPT 2007»
13 years 6 months ago
Using mixed-integer programming to solve power grid blackout problems
We consider optimization problems related to the prevention of large-scale cascading blackouts in power transmission networks subject to multiple scenarios of externally caused da...
Daniel Bienstock, Sara Mattia
DISOPT
2007
84views more  DISOPT 2007»
13 years 6 months ago
Conflict analysis in mixed integer programming
Tobias Achterberg
DISOPT
2007
90views more  DISOPT 2007»
13 years 6 months ago
On the job rotation problem
The job rotation problem (JRP) is the following: Given an n × n matrix A over R ∪ {−∞} and k ≤ n, find a k × k principal submatrix of A whose optimal assignment problem...
Peter Butkovic, Seth Lewis
DISOPT
2007
93views more  DISOPT 2007»
13 years 6 months ago
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak...
DISOPT
2007
93views more  DISOPT 2007»
13 years 6 months ago
A feasibility pump heuristic for general mixed-integer problems
Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very important (NP-complete) problem that can be extremely hard in practice. Very recently, Fisch...
Livio Bertacco, Matteo Fischetti, Andrea Lodi
DISOPT
2007
104views more  DISOPT 2007»
13 years 6 months ago
Approximation of the Quadratic Set Covering problem
Bruno Escoffier, Peter L. Hammer