Solving a continuous local access network design problem with a stabilized central column generation approach

DOI10.1016/j.ejor.2011.05.021zbMath1225.90150OpenAlexW2040889465MaRDI QIDQ635164

M. Trampont, C. Destré, Alain Faye

Publication date: 19 August 2011

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.05.021

zbMATH Keywords

column generationcombinatorial optimizationlocationmulti-source Weber problemcentral cutting plane

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

Combining very large scale and ILP based neighborhoods for a two-level location problem

Cites Work

• Unnamed Item
• A branch-and-price algorithm for the multi-source Weber problem
• A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
• On the exact solution of large-scale simple plant location problems
• An accelerated central cutting plane algorithm for linear semi-infinite programming
• Interior point stabilization for column generation
• On the Complexity of Some Common Geometric Location Problems
• Acceleration of cutting-plane and column generation algorithms: Applications to network design
• The Facility Location Problem with Limited Distances
• A central cutting plane algorithm for the convex programming problem
• An Integer Programming Approach to the Vehicle Scheduling Problem
• Heuristic Methods for Location-Allocation Problems
• Poisson-Voronoi Spanning Trees with Applications to the Optimization of Communication Networks
• The multi-source Weber problem with constant opening cost

This page was built for publication: Solving a continuous local access network design problem with a stabilized central column generation approach