Multistars and directed flow formulations

DOI10.1002/NET.10050MaRDI QIDQ4798191zbMATH OpenOpenAlexFDO

Authors Luis 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)

Recommendations

• The capacitated minimum spanning tree problem: On improved multistar constraints
• A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
• The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
• The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
• Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs

Cited in

(5)

• 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
• Polynomial-time separation of enhanced reverse multistar inequalities
• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
• Comparison of formulations for the inventory routing problem

This page was built for publication: Multistars and directed flow formulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4798191)