A demand-shifting feasibility algorithm for Benders decomposition.

DOI10.1016/S0377-2217(02)00405-8zbMath1035.90044MaRDI QIDQ1812005

Peiling Wu, Joseph C. Hartman, George R. Wilson

Publication date: 18 June 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00405-8

zbMATH Keywords

large-scale optimization; Benders decomposition; fleet sizing; subproblem feasibility

Mathematics Subject Classification ID

90C06: Large-scale problems in mathematical programming

49M27: Decomposition methods

Related Items

The Benders decomposition algorithm: a literature review, Solving a capacitated hub location problem, Solution of preemptive multi-objective network design problems applying Benders decomposition method

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Benders decomposition based heuristic for the hierarchical production planning problem
• Partitioning procedures for solving mixed-variables programming problems
• On using approximations of the Benders master problem
• A Model for Fleet Sizing and Vehicle Allocation
• Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Multicommodity Distribution System Design by Benders Decomposition
• Introduction to Stochastic Programming
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming