A lower bound for the shortest Hamiltonean path in directed graphs

DOI10.1007/BF01719934zbMath0744.90091OpenAlexW2046012925WikidataQ114233931 ScholiaQ114233931MaRDI QIDQ1814249

J. J. C. Salles, Nelson F. Maculan

Publication date: 25 June 1992

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01719934

zbMATH Keywords

directed graphtravelling salesmanLagrange relaxationshortest Hamiltonian path problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Related Items (2)

A strong flow-based formulation for the shortest path problem in digraphs with negative cycles ⋮ Nodal aggregation of resource constraints in a shortest path problem

Cites Work

• A note on two problems in connexion with graphs
• Unnamed Item

This page was built for publication: A lower bound for the shortest Hamiltonean path in directed graphs