Large-scale mixed integer programming: Benders-type heuristics
From MaRDI portal
Publication:789322
DOI10.1016/0377-2217(84)90287-XzbMath0532.90077MaRDI QIDQ789322
Gilles Côté, Michael A. Laughton
Publication date: 1984
Published in: European Journal of Operational Research (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Mixed integer programming (90C11) Deterministic network models in operations research (90B10)
Related Items (34)
On using approximations of the Benders master problem ⋮ Multi-item capacitated lot-sizing by a cross decomposition based algorithm ⋮ New bounding and decomposition approaches for MILP investment problems: multi-area transmission and generation planning under policy constraints ⋮ Recoverable robust single day aircraft maintenance routing problem ⋮ Pre-positioning disaster response facilities at safe locations: an evaluation of deterministic and stochastic modeling approaches ⋮ Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain ⋮ A hybrid approach of bundle and Benders applied large mixed linear integer problem ⋮ Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty ⋮ A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements ⋮ An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation ⋮ A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach ⋮ An interior-point Benders based branch-and-cut algorithm for mixed integer programs ⋮ On generating maximal nondominated Benders cuts ⋮ Speed-up Benders decomposition using maximum density cut (MDC) generation ⋮ Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach ⋮ An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions ⋮ A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture ⋮ A decomposition approach to the two-stage stochastic unit commitment problem ⋮ Stochastic optimization for power system configuration with renewable energy in remote areas ⋮ Recovery strategies from major supply disruptions in single and multiple sourcing networks ⋮ An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming ⋮ Optimal long-term distributed generation planning and reconfiguration of distribution systems: an accelerating Benders' decomposition approach ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems ⋮ Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines ⋮ The Benders decomposition algorithm: a literature review ⋮ Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand ⋮ Management of design activities in a concurrent engineering environment ⋮ A Benders decomposition based heuristic for the hierarchical production planning problem ⋮ A new approach based on the surrogating method in the project time compression problems ⋮ Heuristic methods and applications: A categorized survey ⋮ Improving Benders decomposition using a genetic algorithm ⋮ Capital budgeting with Benders' decomposition ⋮ Acceleration strategies of Benders decomposition for the security constraints power system expansion planning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioning procedures for solving mixed-variables programming problems
- Experiments in integer programming
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- Pivot and Complement–A Heuristic for 0-1 Programming
- Multicommodity Distribution System Design by Benders Decomposition
- On convergence rates of subgradient optimization methods
- Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods
- Application of the adaptive random search to discrete and mixed integer optimization
- A Survey of Lagrangean Techniques for Discrete Optimization
- Validation of subgradient optimization
- Solution of Integer Linear Programming Problems by Direct Search
- An Improved Implicit Enumeration Approach for Integer Programming
- Efficient Heuristic Procedures for Integer Linear Programming with an Interior
- An Approach to Solving Linear Discrete Optimization Problems
- Elements of Large-Scale Mathematical Programming Part I: Concepts
This page was built for publication: Large-scale mixed integer programming: Benders-type heuristics
