"Bi-objective branch-and-cut algorithms applied to the binary knapsack ..."

Audrey Cerqueus (2015)

> Home

Details and statistics

DOI: —

access: open

type: Book or Thesis

metadata version: 2020-07-21

- view
  - electronic edition @ archives-ouvertes.fr (open access)
- export record
  dblp key:
  - phd/hal/Cerqueus15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/hal/Cerqueus15
Audrey Cerqueus:
Bi-objective branch-and-cut algorithms applied to the binary knapsack problem : surrogate upper bound sets, dynamic branching strategies, generation and exploitation of cover inequalities. (Algorithmes de branch-and-cut bi-objectif appliqués au problème du sac-à-dos en variables binaires / Algorithmes de branch-and-cut bi-objectif appliqués au problème du sac-à-dos en variables binaires : ensembles bornants surrogate, stratégies de branchement dynamiques, génération et exploitation d'inégalités de couverture). University of Nantes, France, 2015

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.