Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study.
Richard LaundyMichael PerregaardGabriel TavaresHoria TipiAlkis VazacopoulosPublished in: INFORMS J. Comput. (2009)
Keyphrases
- mixed integer programming problems
- solving hard
- case study
- combinatorial problems
- satisfiability problem
- search problems
- propositional logic
- stochastic local search
- propositional satisfiability
- sat problem
- constraint programming
- search algorithm
- traveling salesman problem
- phase transition
- constraint satisfaction
- orders of magnitude
- constraint satisfaction problems
- combinatorial optimization
- metaheuristic
- temporal logic
- np complete
- sat instances
- knowledge representation
- evolutionary algorithm