Subtitle:

Raport Badawczy = Research Report ; RB/1/2007

Publisher:

Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences

Place of publishing:

Warszawa

Description:

33 pages ; 21 cm ; Bibliography p. 12

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

Detailed Resource Type:

Report

Resource Identifier:

oai:rcin.org.pl:139747

Source:

RB-2007-01

Language:

eng

Language of abstract:

eng

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:

Operational Program Digital Poland, 2014-2020, Measure 2.3: Digital accessibility and usefulness of public sector information; funds from the European Regional Development Fund and national co-financing from the state budget.

Access:

Open