A4 Refereed article in a conference publication
On a quasistability radius for multicriteria integer linear programming problem of finding extremum solutions
Authors: Emelichev Vladimir, Nikulin Yury
Editors: Cherepynets V.
Conference name: International Conference on High Performance Computing
Publishing place: Kyiv
Publication year: 2018
Book title : Fifth International Conference on High Performance Computing (HPC-UA 2018)
First page : 27
Last page: 35
ISBN: 978-966-7690-16-8
Web address : http://hpc-ua.org/hpc-ua-18/proceedings/(external)
Self-archived copy’s web address: https://research.utu.fi/converis/portal/detail/Publication/36624652(external)
We consider a multicriteria problem of integer linear programming with a targeting set of optimal solutions given by the set of all individual criterion minimizers (extrema). In this work, the lower and upper attainable bounds on the quasistability radius of the set of extremum solutions are obtained in the situation where solution and criterion spaces are endowed with various Hölder’s norms. As corollaries, an analytical formula for the quasistability radius is specified in the case where criterion space is endowed with Chebyshev’s norm. Some computational challenges are also discussed.
Downloadable publication This is an electronic reprint of the original article. |