Jansson, Christian
Rigorous Results in Combinatorial Optimization
Abstract
Many current deterministic solvers for NP-hard
combinatorial optimization problems are based on nonlinear
relaxation techniques that use floating point arithmetic.
Occasionally, due to solving these relaxations, rounding errors
may produce erroneous results, although the deterministic
algorithm should compute the exact solution in a finite number of
steps. This may occur especially if the relaxations are
ill-conditioned or ill-posed, and if Slater's constraint
qualifications fail. We show how exact solutions can be obtained
by rigorously bounding the optimal value of semidefinite
relaxations, even in the ill-posed case. All rounding errors due
to floating point arithmetic are taken into account.
BibTeX - Entry
@InProceedings{jansson:DagSemProc.05391.7,
author = {Jansson, Christian},
title = {{Rigorous Results in Combinatorial Optimization}},
booktitle = {Algebraic and Numerical Algorithms and Computer-assisted Proofs},
pages = {1--8},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {5391},
editor = {Bruno Buchberger and Shin'ichi Oishi and Michael Plum and Sigfried M. Rump},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2006/446},
URN = {urn:nbn:de:0030-drops-4467},
doi = {10.4230/DagSemProc.05391.7},
annote = {Keywords: Combinatorial Optimization, Semidefinite Programming, Ill-posed Problems, Verification Methods}
}
|
Keywords: |
|
Combinatorial Optimization, Semidefinite Programming, Ill-posed Problems, Verification Methods |
|
Seminar: |
|
05391 - Algebraic and Numerical Algorithms and Computer-assisted Proofs
|
|
Issue date: |
|
2006 |
|
Date of publication: |
|
31.01.2006 |
31.01.2006
