Metadata language
MIP formulation of the adjustment problem for the MST and MHP problems : computational results
Subtitle:Raport Badawczy = Research Report ; RB/1/2007
Creator:Kurnatowski, Jerzy ; Libura, Marek
Publisher:Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
Place of publishing: Date issued/created: Description:33 pages ; 21 cm ; Bibliography p. 12
Subject and Keywords:Mixed-integer programming ; Programowanie z liczbami mieszanymi ; Spanning tree problem ; Minimalne drzewo rozpinające ; Ścieżka Hamiltona ; Minimum hamiltonian path
Abstract: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.
Relation:Raport Badawczy = Research Report
Resource type: Detailed Resource Type: Source: Language: Language of abstract: Rights:Creative Commons Attribution BY 4.0 license
Terms of use: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: ; -
Digitizing institution:Systems Research Institute of the Polish Academy of Sciences
Original in:Library of Systems Research Institute PAS
Projects co-financed by: Access: