An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
From MaRDI portal
Publication:4282274
DOI10.1287/IJOC.5.4.426zbMATH Open0789.90082OpenAlexW2067802172MaRDI QIDQ4282274FDOQ4282274
Authors: Matteo Fischetti, Paolo Toth 
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
Recommendations
Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cited In (31)
- Minimal spanning trees with a constraint on the number of leaves
- A multiperiod min-sum arborescence problem
- Arborescence optimization problems solvable by Edmonds' algorithm
- A column generation model for a scheduling problem with maintenance constraints
- On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
- A simple algorithm and min-max formula for the inverse arborescence problem
- Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs.
- A note on relatives to the Held and Karp 1-tree problem
- Exact solution approaches for the multi-period degree constrained minimum spanning tree problem
- New lower bounds for the symmetric travelling salesman problem
- An exact algorithm for the capacitated shortest spanning arborescence
- A multiperiod degree constrained minimal spanning tree problem
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
- Cluster based branching for the asymmetric traveling salesman problem
- An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
- Minimax regret spanning arborescences under uncertain costs
- A capacitated general routing problem on mixed networks
- A stochastic integer programming approach to air traffic scheduling and operations
- Title not available (Why is that?)
- Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length
- Multicommodity flow models for spanning trees with hop constraints
- Title not available (Why is that?)
- An additive bounding procedure for the asymmetric travelling salesman problem
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences
- A hop constrained min-sum arborescence with outage costs
- The capacitated minimum spanning tree problem: On improved multistar constraints
- Design of capacitated degree constrained min-sum arborescence
- MaxMin allocation via degree lower-bounded arborescences
- Efficiently computing directed minimum spanning trees
- Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates
This page was built for publication: An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4282274)
