Projective Cutting-Planes for robust linear programming and cutting stock problems
Year of publication: |
2022
|
---|---|
Authors: | Porumbel, Daniel |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 5, p. 2736-2753
|
Subject: | 631 programming | 642 programming | 643 programming | algorithms | cutting plane | integer | linear | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Packproblem | Packing problem |
-
Relative robust and adaptive optimization
Bertsimas, Dimitris, (2020)
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
-
A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids
Birgin, Ernesto Julian Goldberg, (2019)
- More ...
-
Porumbel, Daniel, (2017)
-
Constraint aggregation in column generation models for resource-constrained covering problems
Porumbel, Daniel, (2017)
-
Porumbel, Daniel, (2024)
- More ...