Jacques Benders and his decomposition algorithm

DOI10.1016/J.ORL.2025.107361MaRDI QIDQ6890085zbMATH OpenFDO

Authors Karen Aardal, Cor Hurkens, Jan Karel Lenstra

Publication date 4 December 2025

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ORL.2025.107361

zbMATH Keywords

Benders decompositiondecompositionhistory of operations researchoptimization

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70) History of operations research and mathematical programming (90-03) Integer programming (90C10) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites work

• A brief history of linear and mixed-integer programming computation
• A Linear Programming Approach to the Cutting-Stock Problem
• A property of assignment type mixed integer linear programming problems
• An Automatic Method of Solving Discrete Programming Problems
• Decomposition Principle for Linear Programs
• scientific article; zbMATH DE number 3156817 (Why is no real title available?)
• scientific article; zbMATH DE number 3159112 (Why is no real title available?)
• Integer Programming: Methods, Uses, Computations
• Outline of an algorithm for integer solutions to linear programs
• Partitioning procedures for solving mixed-variables programming problems. Reprint
• Solution of a Large-Scale Traveling-Salesman Problem
• The Benders decomposition algorithm: a literature review
• The simple plant location problem: Survey and synthesis

This page was built for publication: Jacques Benders and his decomposition algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6890085)