Sciweavers

47 search results - page 1 / 10
» Automated Configuration of Mixed Integer Programming Solvers
Sort
View
CPAIOR
2010
Springer
13 years 7 months ago
Automated Configuration of Mixed Integer Programming Solvers
Abstract. State-of-the-art solvers for mixed integer programming (MIP) problems are highly parameterized, and finding parameter settings that achieve high performance for specific ...
Frank Hutter, Holger H. Hoos, Kevin Leyton-Brown
SPLC
2008
13 years 5 months ago
On SAT Technologies for Dependency Management and Beyond
SAT solvers technology is now mature enough to be part of the engineer toolbox side by side with Mixed Integer Programming and Constraint Programming tools. As of June 2008, two g...
Daniel Le Berre, Anne Parrain
FGCS
2008
109views more  FGCS 2008»
13 years 4 months ago
A grid-aware MIP solver: Implementation and case studies
This paper presents a grid-enabled system for solving large-scale mixed integer programming (MIP) problems. The system has been developed using Globus and MPICH-G2, and consists o...
Emilio Pasquale Mancini, Sonya Marcarelli, Igor Va...
COR
2010
166views more  COR 2010»
13 years 4 months ago
Variable neighbourhood decomposition search for 0-1 mixed integer programs
In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable ...
Jasmina Lazic, Saïd Hanafi, Nenad Mladenovic,...
MP
2007
142views more  MP 2007»
13 years 3 months ago
Active-constraint variable ordering for faster feasibility of mixed integer linear programs
The selection of the branching variable can greatly affect the speed of the branch and bound solution of a mixed-integer or integer linear program. Traditional approaches to branc...
Jagat Patel, John W. Chinneck