Pruning moves

DOI10.1287/IJOC.1090.0329MaRDI QIDQ2899042zbMATH OpenOpenAlexFDO

Authors 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

constraint programmingmixed-integer programmingnogoodsdominance procedure

Mathematics Subject Classification ID

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

Recommendations

• A new dominance procedure for combinatorial optimization problems
• Improving strong branching by domain propagation
• Improving strong branching by propagation
• Local branching
• MIP: Theory and practice -- closing the gap

Cited in

(7)

• Compact representation of near-optimal integer programming solutions
• Automatic generation of dominance breaking nogoods for a class of constraint optimization problems
• Discrete optimization with decision diagrams
• A branch-and-bound algorithm for hard multiple knapsack problems
• How to Correctly Prune Tropical Trees
• Domain reduction techniques for global NLP and MINLP optimization
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning

Describes a project that uses

Uses Software

• MIPLIB2003
• CPLEX
• MIPLIB

This page was built for publication: Pruning moves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2899042)