Problems on Shortest k-Node Cycles and Paths

The paper is devoted to the construction of mathematical models for problems on the shortest cycles and paths, that pass through a given number of nodes of a directed graph. Such cycles and paths are called k-node, where 1<k <n, n is the number of nodes in the graph. Section 1 formulates two p...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Kìbernetika ta komp'ûternì tehnologìï (Online) H. 3; S. 15 - 33
Hauptverfasser:	Stetsyuk, Petro, Solomon, Dumitru, Grygorak, Maria
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	V.M. Glushkov Institute of Cybernetics 30.09.2021
Schlagworte:	ampl boolean variable cplex digraph gurobi hamiltonian cycle hamiltonian path linear programming shortest path travelling salesman problem
ISSN:	2707-4501, 2707-451X
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!