Raport Badawczy = Research Report ; RB/1/2007
Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
33 pages ; 21 cm ; Bibliography p. 12
The paper considers a pair of optimization problems for a given weighted undirected graph: the minimum spanning tree (MST) problem and its restriction, the minimum Hamiltonian path (MHP) problem. For this pair of problems the adjustment problem consists in finding such minimum norm perturbations of weights of edges, which guarantee that the set of optimal solutions of the MST problem in the perturbed graph contains a Hamiltonian path. This paper considers a mixed integer programming (MIP) formulation of the adjustment problem and describe computational results obtained for randomly generated graphs.
Raport Badawczy = Research Report
Creative Commons Attribution BY 4.0 license
Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -
Systems Research Institute of the Polish Academy of Sciences
Library of Systems Research Institute PAS
19 paź 2021
17 wrz 2020
44
https://rcin.org.pl./publication/175216
Libura, Marek Kurnatowski, Jerzy
Śleszyński, Przemysław Sudra, Paweł
Libura, Marek