The Minimum Spanning Tree Problem with Time Window Constraints

DOI10.1080/01966324.1986.10737201zbMath0634.90046OpenAlexW2323511514WikidataQ58150754 ScholiaQ58150754MaRDI QIDQ3773692

Marius M. Solomon

Publication date: 1986

Published in: American Journal of Mathematical and Management Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01966324.1986.10737201

zbMATH Keywords

computational complexityspanning treeNP-hardheuristic algorithmsgreedyinsertiontime window constraintscomputational performance

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Numerical mathematical programming methods (65K05) Integer programming (90C10) Combinatorial optimization (90C27) Differentiable maps on manifolds (58C25)

Related Items (1)

Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Topological design of centralized computer networks—formulations and algorithms
• Computing capacitated minimal spanning trees efficiently
• Implementing vehicle routing algorithms
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• Optimum branchings
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• The Capacitated Minimum Spanning Tree

This page was built for publication: The Minimum Spanning Tree Problem with Time Window Constraints