The lexicographic α-robust knapsack problem
Year of publication: |
2011
|
---|---|
Authors: | Kalai͏̈, Rim ; Vanderpooten, Daniel |
Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 18.2011, 1, p. 103-113
|
Subject: | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming |
-
Consistency cuts for Dantzig-Wolfe reformulations
Lusby, Richard, (2022)
-
Lagrangian relaxation based heuristic for an integrated production and maintenance planning problem
Alaoui-Selsouli, M., (2012)
-
An arc flow-based optimization approach for the two-stage guillotine strip cutting problem
Mrad, Mehdi, (2015)
- More ...
-
One-exact approximate Pareto sets
Herzel, Arne, (2020)
-
Solving efficiently the 0-1 multi-objective knapsack problem
Bazgan, Cristina, (2009)
-
Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
Bazgan, Cristina, (2009)
- More ...