Stabilizing branch‐and‐price for constrained tree problems

DOI10.1002/net.21484zbMath1269.90020OpenAlexW2018733111WikidataQ57705367 ScholiaQ57705367MaRDI QIDQ5326785

Mario Ruthmair, Günther R. Raidl, Markus Leitner

Publication date: 6 August 2013

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21484

zbMATH Keywords

integer linear programmingnetwork designbranch-and-priceSteiner treestabilized column generation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Linear programming (90C05) Deterministic network models in operations research (90B10)

Related Items (3)

On solving bi-objective constrained minimum spanning tree problems ⋮ Stochastic survivable network design problems: theory and practice ⋮ Speeding up column generation for robust wireless network planning

Uses Software

• SCIP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
• Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem
• Benders, metric and cutset inequalities for multicommodity capacitated network design
• SCIP: solving constraint integer programs
• On the choice of explicit stabilizing terms in column generation
• A constrained Steiner tree problem
• The Steiner tree problem with hop constraints
• Stabilized column generation
• Modeling and solving the rooted distance-constrained minimum spanning tree problem
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
• Interior point stabilization for column generation
• Comparison of bundle and classical column generation
• A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
• A proximal trust-region algorithm for column generation stabilization
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
• Local search with perturbations for the prize-collecting Steiner tree problem in graphs
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• An Exact Algorithm for the Steiner Tree Problem with Delays
• Strong Lower Bounds for a Survivable Network Design Problem
• Using Extra Dual Cuts to Accelerate Column Generation
• Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem
• Dual-Optimal Inequalities for Stabilized Column Generation
• The B<scp>oxstep</scp> Method for Large-Scale Optimization
• Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
• A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
• Column Generation
• Selected Topics in Column Generation
• Implementing Mixed Integer Column Generation
• The steiner problem in graphs
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs

This page was built for publication: Stabilizing branch‐and‐price for constrained tree problems