Implementing the branch-and-cut approach for a general purpose Benders’ decomposition framework-Reference-Cited by-同舟云学术

Implementing the branch-and-cut approach for a general purpose Benders’ decomposition framework

Published:2021-04 Issue:2 Volume:290 Page:479-498
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Maher Stephen J.

Funder

Engineering and Physical Sciences Research Council

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference59 articles.

1. Constraint Integer Programming;Achterberg,2007

2. Ahmed, S., Garcia, R., Kong, N., Ntaimo, L., Parija, G., Qiu, F., & Sen, S. (2015). SIPLIB: a stochastic integer programming test problem library. See http://www2.isye.gatech.edu/~sahmed/siplib/Last accessed: 21-04-2020.

3. Improving the integer L-shaped method;Angulo;INFORMS Journal on Computing,2016

4. On a new collection of stochastic linear programming test problems;Ariyawansa;INFORMS Journal on Computing,2004

5. Modular detection of model structure in integer programming;Bastubbe,2018

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Benders decomposition for bi-objective linear programs;European Journal of Operational Research;2024-09

2. Deepest Cuts for Benders Decomposition;Operations Research;2024-08-23

3. An enhanced Benders decomposition method for unique shortest path routing;OPSEARCH;2024-02-03

4. Set covering heuristics in a Benders decomposition for railway timetabling;Computers & Operations Research;2023-11

5. Uncertainty in maritime ship routing and scheduling: A Literature review;European Journal of Operational Research;2023-07