A new dominance procedure for combinatorial optimization problems
From MaRDI portal
Publication:1109683
DOI10.1016/0167-6377(88)90025-9zbMath0655.90064OpenAlexW2017548615MaRDI QIDQ1109683
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
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
Cites Work
This page was built for publication: A new dominance procedure for combinatorial optimization problems