A demand-shifting feasibility algorithm for Benders decomposition.

DOI10.1016/S0377-2217(02)00405-8MaRDI QIDQ1812005zbMATHOpenAlexFDO

Authors 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

Benders decompositionlarge-scale optimizationfleet sizingsubproblem feasibility

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Decomposition methods (49M27)

Recommendations

• Accelerating the Benders decomposition method: application to stochastic network design problems
• Accelerating Benders decomposition: multiple cuts via multiple solutions
• Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
• The Benders decomposition algorithm: a literature review
• Benders decomposition for large-scale uncapacitated hub location

Cites work

• scientific article; zbMATH DE number 3843497 (Why is no real title available?)
• scientific article; zbMATH DE number 1323109 (Why is no real title available?)
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
• A Benders decomposition based heuristic for the hierarchical production planning problem
• A Model for Fleet Sizing and Vehicle Allocation
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
• Introduction to Stochastic Programming
• Multicommodity Distribution System Design by Benders Decomposition
• Network flows. Theory, algorithms, and applications.
• On using approximations of the Benders master problem
• Partitioning procedures for solving mixed-variables programming problems

Cited in

(4)

• Solution of preemptive multi-objective network design problems applying Benders decomposition method
• Solving the one-dimensional cutting stock problem under discrete, uncertain, time-varying demands using a hybrid of special-purpose Benders' decomposition and column generation
• The Benders decomposition algorithm: a literature review
• Solving a capacitated hub location problem

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: A demand-shifting feasibility algorithm for Benders decomposition.

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