@misc{Kurnatowski_Jerzy_MIP_2007,
 author={Kurnatowski, Jerzy and Libura, Marek},
 copyright={Creative Commons Attribution BY 4.0 license},
 address={Warszawa},
 journal={Raport Badawczy = Research Report},
 howpublished={online},
 year={2007},
 publisher={Instytut Badań Systemowych. Polska Akademia Nauk},
 publisher={Systems Research Institute. Polish Academy of Sciences},
 language={eng},
 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.},
 title={MIP formulation of the adjustment problem for the MST and MHP problems : computational results},
 type={Text},
 URL={http://www.rcin.org.pl/Content/139747/PDF/RB-2007-01.pdf},
 keywords={Mixed-integer programming, Programowanie z liczbami mieszanymi, Spanning tree problem, Minimalne drzewo rozpinające, Ścieżka Hamiltona, Minimum hamiltonian path},
}