A new dominance procedure for combinatorial optimization problems

DOI10.1016/0167-6377(88)90025-9zbMath0655.90064MaRDI QIDQ1109683

Matteo Fischetti, Paolo Toth

Publication date: 1988

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(88)90025-9

zbMATH Keywords

heuristics; branch and bound; multiple knapsack problem; dominance criteria

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C27: Combinatorial optimization

90C09: Boolean programming

Related Items

Automatic generation of dominance breaking nogoods for a class of constraint optimization problems, On the exact separation of mixed integer knapsack cuts, A branch-and-bound algorithm for hard multiple knapsack problems, Domain reduction techniques for global NLP and MINLP optimization, Binary decision diagrams for generating and storing non-dominated project portfolios with interval-valued project scores, An exact algorithm for the capacitated shortest spanning arborescence, The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach, Exact lexicographic scheduling and approximate rescheduling, Compact representation of near-optimal integer programming solutions

Uses Software

• Algorithm 632

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithm 632: A program for the 0–1 multiple knapsack problem
• The Fixed Job Schedule Problem with Working-Time Constraints