Bin packing with conflicts : a generic branch-and-price algorithm
Year of publication: |
2013
|
---|---|
Authors: | Sadykov, Ruslan ; Vanderbeck, François |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 25.2013, 2, p. 244-255
|
Subject: | Theorie | Theory | Algorithmus | Algorithm | Operations Research | Operations research |
-
An exact algorithm for the dual bin packing problem
Labbé, Martine, (1993)
-
Approximation algorithms for scheduling a single machine to ninimize total late work
Potts, Chris N., (1991)
-
Arumugam, M. Senthil, (2008)
- More ...
-
Column generation for extended formulations
Sadykov, Ruslan, (2013)
-
Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
Pessoa, Artur, (2021)
-
Primal heuristics for branch and price : the assets of diving methods
Sadykov, Ruslan, (2019)
- More ...