An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
From MaRDI portal
Publication:4282274
DOI10.1287/ijoc.5.4.426zbMath0789.90082MaRDI QIDQ4282274
Publication date: 24 March 1994
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.5.4.426
90C35: Programming involving graphs or networks
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem, A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem, A hop constrained min-sum arborescence with outage costs, Minimax regret spanning arborescences under uncertain costs, An additive bounding procedure for the asymmetric travelling salesman problem, Multicommodity flow models for spanning trees with hop constraints, Minimal spanning trees with a constraint on the number of leaves, Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs., Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, Cluster based branching for the asymmetric traveling salesman problem, New lower bounds for the symmetric travelling salesman problem, A multiperiod degree constrained minimal spanning tree problem, The capacitated minimum spanning tree problem: On improved multistar constraints, A capacitated general routing problem on mixed networks, An exact algorithm for the capacitated shortest spanning arborescence, A note on relatives to the Held and Karp 1-tree problem, A Column Generation Model for a Scheduling Problem with Maintenance Constraints
