An exact algorithm for the capacitated shortest spanning arborescence
type: Item
instance of: scholarly article
title: An exact algorithm for the capacitated shortest spanning arborescence
zbMATH Open document ID: 0844.90104
DOI: 10.1007/BF02098285
author: Daniele Vigo
author: Paolo Toth
published in: Annals of Operations Research
publication date: 1996-03-18T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 93C10
zbMATH DE Number: 847659
zbMATH Keywords: capacitated shortest spanning arborescence
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: heuristic algorithms
zbMATH Keywords: complete and loop-free digraph
zbMATH Keywords: routing
zbMATH Keywords: network design
zbMATH Keywords: branch-and-bound
describes a project that uses: VRP
MaRDI profile type: Publication
cites work: Q3056948
cites work: Pathology of Traveling-Salesman Subtour-Elimination Algorithms
cites work: A branch and bound algorithm for the multiple depot vehicle scheduling problem
cites work: New lower bounds for the symmetric travelling salesman problem
cites work: The Capacitated Minimum Spanning Tree
cites work: Optimum branchings
cites work: Q4205235
cites work: A new dominance procedure for combinatorial optimization problems
cites work: An Additive Bounding Procedure for Combinatorial Optimization Problems
cites work: An additive bounding procedure for the asymmetric travelling salesman problem
cites work: An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
cites work: A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
cites work: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
cites work: Efficient algorithms for a family of matroid intersection problems
cites work: Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
cites work: Computing capacitated minimal spanning trees efficiently
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: Q3993418
cites work: A branch and bound algorithm for the capacitated minimum spanning tree problem
cites work: The complexity of the capacitated tree problem
cites work: Finding optimum branchings
cites work: An Exact Algorithm for the Vehicle Routing Problem with Backhauls
cites work: A heuristic algorithm for the asymmetric capacitated vehicle routing problem
cites work: An exact algorithm for the asymmetrical capacitated vehicle routing problem
description: scientific article; zbMATH DE number 847659