Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs

DOI10.1016/S0377-2217(99)00043-0zbMath0959.90057OpenAlexW1994343300MaRDI QIDQ1969869

Maria João Lopes, Luís Gouveia

Publication date: 19 March 2000

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00043-0

zbMATH Keywords

valid inequalitiescapacitated treessingle and multicommodity flow modelssubset sum problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

The capacitated minimum spanning tree problem: On improved multistar constraints, Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations, Network flow models for the local access network expansion problem, A node rooted flow-based model for the local access network expansion problem, Savings based ant colony optimization for the capacitated minimum spanning tree problem

Cites Work

• Unnamed Item
• Unnamed Item
• Finding minimum cost directed trees with demands and capacities
• The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
• Topological design of centralized computer networks—formulations and algorithms
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
• A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
• Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem