Publication:2861520
From MaRDI portal
zbMath1274.90310MaRDI QIDQ2861520
Publication date: 8 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001265
Related Items
Spanning trees with variable degree bounds, Prize collecting Steiner trees with node degree dependent costs, Enhancing discretized formulations: the knapsack reformulation and the star reformulation, Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
Cites Work
- Unnamed Item
- Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks
- 0-1 reformulations of the multicommodity capacitated network design problem
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
- On the capacitated concentrator location problem: a reformulation by discretization
- Discretized formulations for capacitated location problems with modular distribution costs
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
- Lower and upper bounds for the degree-constrained minimum spanning tree problem
- A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
