Problem statements for \(k\)-node shortest path and \(k\)-node shortest cycle in a complete graph

DOI10.1007/S10559-016-9801-XzbMath1338.05141OpenAlexW2330506180MaRDI QIDQ289795

F. Blanchet-Sadri, M. Dambrine

Publication date: 31 May 2016

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-016-9801-x

zbMATH Keywords

shortest pathHamiltonian cycletraveling salesman problemHamiltonian pathcomplete graphlinear programming problem

Mathematics Subject Classification ID

Paths and cycles (05C38) Boolean programming (90C09)

Related Items (1)

Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks

Uses Software

• Gurobi

Cites Work

• Unnamed Item

This page was built for publication: Problem statements for \(k\)-node shortest path and \(k\)-node shortest cycle in a complete graph