Pruning Moves

DOI10.1287/ijoc.1090.0329zbMath1243.90136OpenAlexW2911235430MaRDI QIDQ2899042

Matteo Fischetti, Domenico Salvagnin

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/d5ca20063d249f27f2d8556578da1daf76d69b0b

zbMATH Keywords

nogoodsconstraint programmingmixed-integer programmingdominance procedure

Mathematics Subject Classification ID

Integer programming (90C10) Interior-point methods (90C51)

Related Items

Automatic generation of dominance breaking nogoods for a class of constraint optimization problems, Compact representation of near-optimal integer programming solutions, Domain reduction techniques for global NLP and MINLP optimization, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, A branch-and-bound algorithm for hard multiple knapsack problems, Discrete Optimization with Decision Diagrams

Uses Software

• MIPLIB
• CPLEX
• MIPLIB2003