A closest benders cut selection scheme for accelerating the benders decomposition algorithm
Year of publication: |
2022
|
---|---|
Authors: | Seo, Kiho ; Joung, Seulgi ; Lee, Chungmok ; Park, Sungsoo |
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. 2804-2827
|
Subject: | Benders decomposition algorithm | fractional programming problem | multicommodity capacitated fixed-charge network design problem | optimality cut | Pareto-optimal cut | Dekompositionsverfahren | Decomposition method | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm |
-
A two-stage robust hub location problem with accelerated Benders decomposition algorithm
Rahmati, Reza, (2022)
-
Hamzadayı, Alper, (2020)
-
Mingozzi, Aristide, (2018)
- More ...
-
A linear programming based heuristic algorithm for bandwidth packing problem with scheduling
Joung, Seulgi, (2020)
-
Lifting of probabilistic cover inequalities
Joung, Seulgi, (2017)
-
Multi-class classification using a signomial function
Hwang, Kyoungmi, (2015)
- More ...