An interior-point Benders based branch-and-cut algorithm for mixed integer programs
From MaRDI portal
Publication:2442074
Recommendations
- The integration of an interior-point cutting plane method within a branch-and-price algorithm
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Accelerating Benders decomposition by local branching
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
- Computational Integer Programming and Cutting Planes
Cites work
- A cutting plane method from analytic centers for stochastic programming
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- A note on the selection of Benders' cuts
- A survey on Benders decomposition applied to fixed-charge network design problems
- Accelerating Benders decomposition by local branching
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Accelerating Benders method using covering cut bundle generation
- Branch-and-price: Column generation for solving huge integer programs
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Complexity estimates of some cutting plane methods based on the analytic barrier
- Computational Experience with an Interior Point Cutting Plane Algorithm
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Exact solution of the centralized network design problem on directed graphs
- Generalized Benders decomposition
- scientific article; zbMATH DE number 949665 (Why is no real title available?)
- Large-scale mixed integer programming: Benders-type heuristics
- Location of the Maximum on Unimodal Surfaces
- Multicommodity Distribution System Design by Benders Decomposition
- On constrained optimization by adjoint based quasi-Newton methods
- Partitioning procedures for solving mixed-variables programming problems
- Resolution method for mixed integer bi-level linear problems based on decomposition technique
- Solving combinatorial optimization problems using Karmarkar's algorithm
- The Cutting-Plane Method for Solving Convex Programs
- The integration of an interior-point cutting plane method within a branch-and-price algorithm
- Warm start of the primal-dual method applied in the cutting-plane scheme
Cited in
(38)- A branch-and-check approach for a wind turbine maintenance scheduling problem
- An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming
- The Benders decomposition algorithm: a literature review
- Benders decomposition: solving binary master problems by enumeration
- The integration of an interior-point cutting plane method within a branch-and-price algorithm
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- Design and implementation of a modular interior-point solver for linear optimization
- Benders decomposition applied to profit maximizing hub location problem with incomplete hub network
- The rank pricing problem with ties
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- An accelerated L-shaped method for solving two-stage stochastic programs in disaster management
- Accelerating Benders decomposition: multiple cuts via multiple solutions
- Simultaneously exploiting two formulations: an exact Benders decomposition approach
- A Benders decomposition algorithm for demand-driven metro scheduling
- Robust critical node selection by Benders decomposition
- Improved branching disjunctions for branch-and-bound: an analytic center approach
- Benders decomposition without separability: a computational study for capacitated facility location problems
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
- Benders decomposition for production routing under demand uncertainty
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm
- The Benders dual decomposition method
- Learning optimized risk scores
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- An interior point cutting plane heuristic for mixed integer programming
- Experimentation with Benders decomposition for solving the two-timescale stochastic generation capacity expansion problem
- An asynchronous parallel benders decomposition method for stochastic network design problems
- Literature review on Benders cut selection and a multiple cut generation scheme
- A benders-branch-and-cut methodology for global cargo vessel traffic prediction given declining arctic sea ice and changing risks
- SDP-based Benders decomposition for solving p-median quadratic facility location problems
- A decomposition scheme for Wasserstein distributionally robust emergency relief network design under demand uncertainty and social donations
- The ordered median tree location problem
- Last fifty years of integer linear programming: a focus on recent practical advances
- A hierarchical hub location model for the integrated design of urban and rural logistics networks under demand uncertainty
- Benders decomposition for the discrete ordered median problem
- Multiobjective facility location model for optimizing Arctic oil spill response
- Large-scale mixed integer programming: Benders-type heuristics
This page was built for publication: An interior-point Benders based branch-and-cut algorithm for mixed integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2442074)
