Discrete optimization problems with interval data: Pareto set of solutions or set of weak solutions?

DOI10.1023/B:REOM.0000047095.22096.16zbMath1075.65083OpenAlexW2080559046MaRDI QIDQ701961

Galina Kozina

Publication date: 17 January 2005

Published in: Reliable Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:reom.0000047095.22096.16

zbMATH Keywords

optimizationlinear programmingoptimal solutionsspanning treetravelling salesmanperfect matchinginterval dataPareto set

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interval and finite arithmetic (65G30)

This page was built for publication: Discrete optimization problems with interval data: Pareto set of solutions or set of weak solutions?