Analysis of MILP techniques for the pooling problem
Year of publication: |
2015
|
---|---|
Authors: | Dey, Santanu S. ; Gupte, Akshay |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 63.2015, 2, p. 412-427
|
Subject: | integer | heuristic | nonlinear | networks/graphs | multicommodity | Operations Research | Operations research | Heuristik | Heuristics | Ganzzahlige Optimierung | Integer programming | USA | United States | Theorie | Theory |
-
A heuristic approach for designing cyclic group codes
Strapasson, João E., (2016)
-
Hierarchical benders decomposition for open-pit mine block sequencing
Vossen, Thomas W. M., (2016)
-
Examination timetabling problem with scarce resources : a case study
Keskin, Muhammed Emre, (2018)
- More ...
-
Efficient storage of Pareto points in biobjective mixed integer programming
Adelgren, Nathan, (2018)
-
A mean-risk mixed integer nonlinear program for transportation network protection
Lu, Jie, (2018)
-
Branch-and-bound for biobjective mixed-integer linear programming
Adelgren, Nathan, (2022)
- More ...