A branch-and-price algorithm for the bin packing problem with conflicts
Year of publication: |
2011
|
---|---|
Authors: | Elhedhli, Samir ; Li, Lingzi ; Gzara, Mariem ; Naoum-Sawaya, Joe |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 23.2011, 3, p. 404-415
|
Subject: | Packproblem | Packing problem | Algorithmus | Algorithm | Heuristik | Heuristics | Theorie | Theory |
-
An improved best-fit heuristic for the orthogonal strip packing problem
Verstichel, Jannes, (2013)
-
DomÃnguez, Oscar, (2014)
-
A column generation-based heuristic for the three-dimensional bin packing problem with rotation
Mahvash, Batoul, (2018)
- More ...
-
Strategic blockchain adoption to deter deceptive counterfeiters
Naoum-Sawaya, Joe, (2023)
-
A stochastic optimization model for real-time ambulance redeployment
Naoum-Sawaya, Joe, (2013)
-
An interior-point Benders based branch-and-cut algorithm for mixed integer programs
Naoum-Sawaya, Joe, (2013)
- More ...