Open Problems on Benders Decomposition Algorithm

Georgios K. D. Saharidis and Antonios Fragkogios
Additional contact information
Georgios K. D. Saharidis: University of Thessaly
Antonios Fragkogios: University of Thessaly

A chapter in Open Problems in Optimization and Data Analysis, 2018, pp 305-317 from Springer

Abstract: Abstract The Benders decomposition method is based on the idea of exploiting the structure of an optimization problem so that its solution can be obtained as the solution of several smaller subproblems. We review here the fundamental method proposed by Jacobus F. Benders and present several open problems related to its application.

Keywords: Benders decomposition; Open problems; Mixed integer programming (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (2)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-99142-9_16

Ordering information: This item can be ordered from
http://www.springer.com/9783319991429

DOI: 10.1007/978-3-319-99142-9_16

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().