A new dominance procedure for combinatorial optimization problems

Authors:
Matteo Fischetti;Paolo Toth
Affiliations:
DEIS, University of Bologna, viale Risorgimento, 2, 40136 Bologna, Italy;DEIS, University of Bologna, viale Risorgimento, 2, 40136 Bologna, Italy
Venue:
Operations Research Letters
Year:
1988

Citing 3
Cited 0

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
The fixed job schedule problem with spread-time constraints

Operations Research
Algorithm 632: A program for the 0–1 multiple knapsack problem

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is known that the effectiveness of the branch and bound algorithms for combinatorial optimization problems can be improved through dominance criteria which allow fathomings of large solution subsets. We describe a new dominance procedure which overcomes some of the drawbacks of the commonly used dominance criteria. An application to the Multiple Knapsack Problem and some computational results are also reported.