Speeding up column generation for robust wireless network planning

DOI10.1007/s13675-013-0013-0zbMath1298.90013OpenAlexW2021774950MaRDI QIDQ743642

Grit Claßen, Anke Schmeink, Arie M. C. A. Koster

Publication date: 30 September 2014

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13675-013-0013-0

zbMATH Keywords

column generationbranch-and-pricerobust optimisationwireless network planning

Mathematics Subject Classification ID

Mixed integer programming (90C11) Communication networks in operations research (90B18) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Uses Software

• SCIP
• CPLEX
• Algorithm 457

Cites Work

• A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks
• Recoverable robust knapsacks: the discrete scenario case
• SCIP: solving constraint integer programs
• Robust discrete optimization and network flows
• The complexity of base station positioning in cellular networks
• Optimum positioning of base stations for cellular radio networks
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem
• The Price of Robustness
• Column Generation
• Selected Topics in Column Generation
• Stabilizing branch‐and‐price for constrained tree problems
• Implementing Mixed Integer Column Generation
• Algorithm 457: finding all cliques of an undirected graph

This page was built for publication: Speeding up column generation for robust wireless network planning