A new dominance procedure for combinatorial optimization problems

DOI10.1016/0167-6377(88)90025-9zbMath0655.90064OpenAlexW2017548615MaRDI 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

heuristicsbranch and boundmultiple knapsack problemdominance criteria

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (9)

An exact algorithm for the capacitated shortest spanning arborescence ⋮ The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach ⋮ 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 ⋮ Binary decision diagrams for generating and storing non-dominated project portfolios with interval-valued project scores ⋮ On the exact separation of mixed integer knapsack cuts ⋮ A branch-and-bound algorithm for hard multiple knapsack problems ⋮ Exact lexicographic scheduling and approximate rescheduling

Uses Software

• Algorithm 632

Cites Work

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

This page was built for publication: A new dominance procedure for combinatorial optimization problems