Acceleration of cutting-plane and column generation algorithms: Applications to network design
From MaRDI portal
Publication:3418117
DOI10.1002/NET.20137zbMATH Open1131.90047OpenAlexW4234009545MaRDI QIDQ3418117FDOQ3418117
Authors: Walid Ben-Ameur, José Neto 
Publication date: 2 February 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20137
Recommendations
- Network design applications of the class of column generation/simplicial decomposition algorithms in convex differentiable optimization
- scientific article; zbMATH DE number 1003253
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- Speeding up column generation for robust wireless network planning
- Faster algorithms for the generalized network flow problem
- Cross line and column generation for the cut covering problem in wireless networks
- Approximation algorithms for network design problems
- Simpler and better approximation algorithms for network design
- A class of network optimization methods for planar grid generation
- A directed cycle-based column-and-cut generation method for capacitated survivable network design
Cites Work
Cited In (41)
- Benders decomposition for network design covering problems
- Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems
- Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics
- A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem
- Reformulating the disjunctive cut generating linear program
- Using extra dual cuts to accelerate column generation
- Accelerated Benders decomposition and local branching for dynamic maximum covering location problems
- Interval scheduling with economies of scale
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- Network design applications of the class of column generation/simplicial decomposition algorithms in convex differentiable optimization
- Solving the optimum communication spanning tree problem
- Four Good Reasons to Use an Interior Point Solver Within a MIP Solver
- Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing
- A Benders decomposition based framework for solving cable trench problems
- The rank pricing problem with ties
- Solving minimum-cost shared arborescence problems
- Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation
- Implementing automatic benders decomposition in a modern MIP solver
- Models and algorithms for the product pricing with single-minded customers requesting bundles
- Benders Subproblem Decomposition for Bilevel Problems with Convex Follower
- Routing of uncertain traffic demands
- A geometric characterization of ``optimality-equivalent relaxations
- Reflections on generating (disjunctive) cuts
- Speeding up column generation for robust wireless network planning
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Mixed-integer formulations for the capacitated rank pricing problem with envy
- Chebyshev center based column generation
- Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks
- Solving a continuous local access network design problem with a stabilized central column generation approach
- Three network design problems for community energy storage
- Dynamic multi-appointment patient scheduling for radiation therapy
- A constraint generation algorithm for large scale linear programs using multiple-points separation
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria
- The Benders by batch algorithm: design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs
- A Scalable Algorithm for Sparse Portfolio Selection
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
- Integer linear programming for the Bayesian network structure learning problem
- Coordinated cutting plane generation via multi-objective separation
- A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
- A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones
Uses Software
This page was built for publication: Acceleration of cutting-plane and column generation algorithms: Applications to network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3418117)
