On using approximations of the Benders master problem

DOI10.1016/0377-2217(94)90032-9MaRDI QIDQ1333479zbMATH OpenOpenAlexFDO

Authors Kaj Holmberg

Publication date 17 April 1995

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

Full work available at URL https://doi.org/10.1016/0377-2217(94)90032-9

zbMATH Keywords

heuristicsLagrange multipliersLagrange dualityBenders' decompositionsurrogate duality

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mixed integer programming (90C11)

Recommendations

• The Benders dual decomposition method
• Benders decomposition: solving binary master problems by enumeration
• Accelerating Benders decomposition with heuristic master problem solutions
• Inexact Cuts in Benders Decomposition
• Extension of the generalized benders' decomposition

Cites work

• scientific article; zbMATH DE number 3843497 (Why is no real title available?)
• scientific article; zbMATH DE number 3675616 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 3894826 (Why is no real title available?)
• scientific article; zbMATH DE number 3282977 (Why is no real title available?)
• A Benders decomposition based heuristic for the hierarchical production planning problem
• A Cross Decomposition Algorithm for Capacitated Facility Location
• A Model and Solution Algorithm for Optimal Routing of a Time-Chartered Containership
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Cross decomposition for mixed integer programming
• Decomposition Principle for Linear Programs
• Expedients for solving some specially structured mixed-integer programs
• Large-scale mixed integer programming: Benders-type heuristics
• Minimization of unsmooth functionals
• Multicommodity Distribution System Design by Benders Decomposition
• On the convergence of cross decomposition
• Partitioning procedures for solving mixed-variables programming problems
• Some relationships between lagrangian and surrogate duality in integer programming
• Surrogate Constraint Duality in Mathematical Programming
• Surrogate Dual Multiplier Search Procedures in Integer Programming
• Surrogate Mathematical Programming
• Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
• Validation of subgradient optimization

Cited in

(11)

• Pre-positioning disaster response facilities at safe locations: an evaluation of deterministic and stochastic modeling approaches
• The Benders decomposition algorithm: a literature review
• A demand-shifting feasibility algorithm for Benders decomposition.
• The star degree centrality problem: a decomposition approach
• New bounding and decomposition approaches for MILP investment problems: multi-area transmission and generation planning under policy constraints
• Benders decomposition: solving binary master problems by enumeration
• Speed-up Benders decomposition using maximum density cut (MDC) generation
• A new approach based on the surrogating method in the project time compression problems
• A hybrid approach of bundle and Benders applied large mixed linear integer problem
• Benders decomposition, Lagrangean relaxation and metaheuristic design
• Application of Benders' decomposition to power plant preventive maintenance scheduling

This page was built for publication: On using approximations of the Benders master problem

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