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

DOI10.1007/S10559-016-9801-XzbMATH Open1338.05141OpenAlexW2330506180MaRDI QIDQ289795FDOQ289795

Authors: P. I. Stetsyuk 

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

Recommendations

• A note on finding a shortest complete cycle in an undirected graph
• New formulations for the elementary shortest-path problem visiting a given set of nodes
• scientific article; zbMATH DE number 1560329
• scientific article; zbMATH DE number 1445588
• scientific article; zbMATH DE number 3847427

zbMATH Keywords

Hamiltonian cycleHamiltonian pathshortest pathtraveling salesman problemcomplete graphlinear programming problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)

Cited In (2)

• Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks
• A note on finding a shortest complete cycle in an undirected graph

Uses Software

• Gurobi

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289795)