Multistars and directed flow formulations

DOI10.1002/net.10050zbMath1035.90097OpenAlexW2020295203MaRDI QIDQ4798191

Luís Gouveia, Leslie A. Hall

Publication date: 19 March 2003

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

integer programmingseparation algorithmspolyhedral projectioncapacitated trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Related Items

A biased random-key genetic algorithm for the capacitated minimum spanning tree problem ⋮ Comparison of formulations for the inventory routing problem ⋮ Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation ⋮ Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network