Large-scale mixed integer programming: Benders-type heuristics
From MaRDI portal
Publication:789322
DOI10.1016/0377-2217(84)90287-XzbMATH Open0532.90077MaRDI QIDQ789322FDOQ789322
Authors: Gilles Côté, Michael A. Laughton 
Publication date: 1984
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- The Benders dual decomposition method
- General purpose heuristics for integer programming. II
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- scientific article; zbMATH DE number 605178
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10) Mixed integer programming (90C11)
Cites Work
- On convergence rates of subgradient optimization methods
- Partitioning procedures for solving mixed-variables programming problems
- Multicommodity Distribution System Design by Benders Decomposition
- Title not available (Why is that?)
- Validation of subgradient optimization
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- An Improved Implicit Enumeration Approach for Integer Programming
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods
- A Survey of Lagrangean Techniques for Discrete Optimization
- Pivot and Complement–A Heuristic for 0-1 Programming
- Efficient Heuristic Procedures for Integer Linear Programming with an Interior
- Title not available (Why is that?)
- Experiments in integer programming
- Title not available (Why is that?)
- Application of the adaptive random search to discrete and mixed integer optimization
- Solution of Integer Linear Programming Problems by Direct Search
- An Approach to Solving Linear Discrete Optimization Problems
Cited In (40)
- Acceleration strategies of Benders decomposition for the security constraints power system expansion planning
- Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem
- An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation
- Pre-positioning disaster response facilities at safe locations: an evaluation of deterministic and stochastic modeling approaches
- Pivot and shift -- a mixed integer programming heuristic
- Stochastic optimization for power system configuration with renewable energy in remote areas
- Improving Benders decomposition using a genetic algorithm
- The Benders decomposition algorithm: a literature review
- Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand
- Heuristic methods and applications: A categorized survey
- A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements
- A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture
- Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain
- Optimal long-term distributed generation planning and reconfiguration of distribution systems: an accelerating Benders' decomposition approach
- A partitioning method that generates interpretable prices for integer programming problems
- New bounding and decomposition approaches for MILP investment problems: multi-area transmission and generation planning under policy constraints
- An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
- 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
- A new approach based on the surrogating method in the project time compression problems
- A Benders decomposition based heuristic for the hierarchical production planning problem
- Recoverable robust single day aircraft maintenance routing problem
- A decomposition approach to the two-stage stochastic unit commitment problem
- A survey on the continuous nonlinear resource allocation problem
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Experimentation with Benders decomposition for solving the two-timescale stochastic generation capacity expansion problem
- On using approximations of the Benders master problem
- Multi-item capacitated lot-sizing by a cross decomposition based algorithm
- A hybrid approach of bundle and Benders applied large mixed linear integer problem
- Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty
- Capital budgeting with Benders' decomposition
- A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach
- Management of design activities in a concurrent engineering environment
- Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines
- A Benders approach to the minimum chordal completion problem
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- Accelerating the Benders decomposition method: application to stochastic network design problems
- An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming
- Recovery strategies from major supply disruptions in single and multiple sourcing networks
This page was built for publication: Large-scale mixed integer programming: Benders-type heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q789322)
