A polyhedral study on 0-1 knapsack problems with set packing constraints
Year of publication: |
March 2016
|
---|---|
Authors: | Cañavate, Roberto J. ; Landete, Mercedes |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 44.2016, 2, p. 243-249
|
Subject: | Knapsack polytope | Cover inequality | Facets | Set packing polytope | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Packproblem | Packing problem |
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
-
Integrating two-dimensional cutting stock and lot-sizing problems
Silva, E., (2014)
-
Chance-constrained binary packing problems
Song, Yongjia, (2014)
- More ...
-
Extreme points of discrete location polyhedra
Cánovas, Lázaro, (2001)
-
The multiple vehicle pickup and delivery problem with LIFO constraints
Benavent, Enrique, (2015)
-
New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
García, Sergio, (2012)
- More ...