A branch-and-cut method for the bi-objective bi-dimensional knapsack problem

Abstract : This work presents a branch-and-cut method to solve exactly the bi-objective bi-dimensional knapsack problem. Its main component is the generation of valid inequalities forbiding a set of incompatible items. We will describe the different mechanisms of our branch-and-cut (separation procedure, bound sets, generation of valid inequalities…) and experimentally validate them.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01242177
Contributor : Audrey Cerqueus <>
Submitted on : Friday, December 11, 2015 - 3:26:04 PM
Last modification on : Friday, August 2, 2019 - 3:36:15 PM

Identifiers

  • HAL Id : hal-01242177, version 1

Citation

Audrey Cerqueus, Xavier Gandibleux, Anthony Przybylski, Stefan Ruzika, Frédéric Saubion. A branch-and-cut method for the bi-objective bi-dimensional knapsack problem. Workshop Recent Advances in Multi-Objective Optimization, Jun 2015, Nantes, France. ⟨hal-01242177⟩

Share

Metrics

Record views

131