Stabilizing branch-and-price for constrained tree problems
From MaRDI portal
Recommendations
- Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem
- On the hop constrained Steiner tree problem with multiple root nodes
- On solving the rooted delay- and delay-variation-constrained Steiner tree problem
- A constrained Steiner tree problem
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
Cites work
- A constrained Steiner tree problem
- A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- A proximal trust-region algorithm for column generation stabilization
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- An exact algorithm for the Steiner tree problem with delays
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- Branch-and-price: Column generation for solving huge integer programs
- Column Generation
- Comparison of bundle and classical column generation
- Dual-Optimal Inequalities for Stabilized Column Generation
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1062478 (Why is no real title available?)
- scientific article; zbMATH DE number 1445375 (Why is no real title available?)
- Implementing Mixed Integer Column Generation
- Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
- Interior point stabilization for column generation
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs
- Modeling and solving the rooted distance-constrained minimum spanning tree problem
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- On the choice of explicit stabilizing terms in column generation
- Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem
- SCIP: solving constraint integer programs
- Selected Topics in Column Generation
- Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem
- Stabilized column generation
- Strong lower bounds for a survivable network design problem
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
- The steiner problem in graphs
- The Steiner tree problem with hop constraints
- Using extra dual cuts to accelerate column generation
Cited in
(8)- Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree
- Stochastic survivable network design problems: theory and practice
- Stronger column generation bounds for the minimum cost hop-and-root constrained forest problem
- Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem
- Branch-and-Price Guided Search
- On solving bi-objective constrained minimum spanning tree problems
- Branching in branch-and-price: A generic scheme
- Speeding up column generation for robust wireless network planning
This page was built for publication: Stabilizing branch-and-price for constrained tree problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326785)
