Subgradient optimization and Benders decomposition for large scale programming
Year of publication: |
1984
|
---|---|
Authors: | Minoux, Michel |
Published in: |
Mathematical programming : proceedings of the International Congress on Mathematical Programming Rio de Janeiro, Brazil, 6-8 April, 1981. - Amsterdam [u.a.] : North-Holland, ISBN 0-444-86821-6. - 1984, p. 271-288
|
Subject: | Mathematische Optimierung | Mathematical programming | Dekompositionsverfahren | Decomposition method | Theorie | Theory |
-
A fast algorithm for buffer allocation problem
Li, Lei, (2016)
-
Yin, Jiateng, (2022)
-
Eom, Myungeun, (2023)
- More ...
-
A strong flow-based formulation for the shortest path problem in digraphs with negative cycles
Ibrahim, Mamane Souley, (2009)
-
Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources
Gicquel, Celine, (2011)
-
Accelerating Benders method using covering cut bundle generation
Saharidis, Georgios K. D., (2010)
- More ...