Login / Signup
Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets.
Alberto Del Pia
Jeff T. Linderoth
Haoran Zhu
Published in:
IPCO (2021)
Keyphrases
</>
totally ordered
partially ordered
multiple knapsack
cover inequalities
partial rankings
combinatorial optimization problems
genetic algorithm
computational complexity
upper bound
rank aggregation
partial ordering