On generating maximal nondominated Benders cuts

Annals of Operations Research

Volumn 210, Issue 1, 2013, Pages 57-72

  Sherali, Hanif D ^a   Lunday, Brian J ^b  

^a State University   (United States)

^b UNITED STATES MILITARY ACADEMY   (United States)

Author keywords

Benders decomposition; Maximal cuts; Nondominated cuts; Pareto optimal cuts

Indexed keywords

EID: 84886723576     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-011-0883-6     Document Type: Article

References (30)

1. Bazaraa, M. S., Jarvis, J. J., & Sherali, H. D. (2010). Linear programming and network flows (4th edn.). Hoboken: Wiley.
2. Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4(1), 238-252.
3. Codato, G., & Fischetti, M. (2006). Combinatorial Benders' cuts for mixed-integer linear programming. Operations Research, 54(4), 756-766.
4. Costa, A. M. (2005). A survey on Benders decomposition applied to fixed-charge network design problems. Computers & Operations Research, 32(6), 1429-1450.
5. Côté, G., & Laughton, M. A. (1984). Large-scale mixed integer programming: Benders-type heuristics. European Journal of Operational Research, 16(3), 327-333.
6. Fischetti, M., & Lodi, A. (2003). Local branching. Mathematical Programming, 98(1-3), 23-47.
7. Fischetti, M., Salvagnin, D., & Zanette, A. (2010). A note of the selection of Benders' cuts. Mathematical Programming, 124(1-2), 175-182.
8. Geoffrion, A. M. (1972). Generalized Benders decomposition. Journal of Optimization Theory and Applications, 10(4), 237-260.
9. Geoffrion, A. M., & Graves, G. W. (1974). Multicommodity distribution system design by Benders decomposition. Management Science, 20(5), 822-844.
10. Haouari, M., Mrad, M., & Sherali, H. D. (2007). Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements. Optimization Letters, 1(4), 341-354.
11. Magnanti, T. L., & Wong, R. T. (1981). Accelerating Benders decomposition: algorithmic enhancement and model selection criteria. Operations Research, 29(3), 464-484.
12. Magnanti, T. L., & Wong, R. T. (1990). Decomposition methods for facility location problems. In P. B. Mirchandani & R. L. Francis (Eds.), Discrete location theory (pp. 209-262). Hoboken: Wiley.
13. McDaniel, D., & Devine, M. (1977). A modified Benders' partitioning algorithm for mixed integer programming. Management Science, 24(3), 312-319.
14. Mercier, A., & Soumis, F. (2007). An integrated aircraft routing, crew scheduling, and flight retiming model. Computers & Operations Research, 34(8), 2251-2265.
15. Mercier, A., Cordeau, J., & Soumis, F. (2005). A computational study of benders decomposition for the integrated aircraft routing and crew scheduling problem. Computers & Operations Research, 32(6), 1451-1476.
16. Nemhauser, G. L., & Wolsey, L. A. (1999). Integer and combinatorial optimization. Hoboken: Wiley.
17. Papadakos, N. (2008). Practical enhancements to the Magnanti-Wong method. Operations Research Letters, 36(4), 444-449.
18. Papadakos, N. (2009). Integrated airline scheduling. Computers & Operations Research, 36(1), 176-195.
19. Rei, W., Cordeau, J.-F., Gendreau, M., & Soriano, P. (2009). Accelerating Benders decomposition by local branching. INFORMS Journal on Computing, 21(2), 333-345.
20. Saharidis, G. K. D., & Ierapetritou, M. G. (2010). Improving Benders decomposition using maximum feasible subsystem (MFS) cut generation strategy. Computers & Chemical Engineering, 34(8), 1237-1245.
21. Saharidis, G. K. D., Minoux, M., & Ierapetritou, M. G. (2010). Accelerating Benders method using covering cut bundle generation. International Transactions in Operational Research, 17(2), 221-237.
22. Sandhu, R., & Klabjan, D. (2004). Integrated airline planning. In Proceedings of the 44th AGIFORS annual symposium, Singapore.
23. Santoso, T., Ahmed, S., Goetschalckx, M., & Shapiro, A. (2005). A stochastic programming approach for supply chain network design under uncertainty. European Journal of Operational Research, 167(1), 96-115.
24. Sherali, H. D. (1982). Equivalent weights for lexicographic multi-objective programs: characterizations and computations. European Journal of Operational Research, 11(4), 367-379.
25. Sherali, H. D., Bae, K., & Haouari, M. (2010). A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture. Annals of Operations Research (to appear).
26. Sherali, H. D., & Soyster, A. L. (1983). Preemptive and nonpreemptive multi-objective programming: relationships and counterexamples. Journal of Optimization Theory and Applications, 39(2), 173-186.
27. Steuer, R. E. (1986). Multiple criteria optimization: theory, computation, and application. Hoboken: Wiley.
28. van Roy, T. J. (1983). Cross decomposition for mixed integer programming. Mathematical Programming, 25(1), 46-63.
29. Wentges, P. (1996). Accelerating Benders' decomposition for the capacitated facility location problem. Mathematical Methods of Operations Research, 44(2), 267-290.
30. Zakeri, G., Philpott, A. B., & Ryan, D. M. (1998). Inexact cuts in Benders' decomposition. SIAM Journal on Optimization, 10(3), 643-657.