Discrete Optimization Problems with Interval Data: Pareto Set of Solutions or Set of Weak Solutions?

Author： Kozina Galina  

Publisher： Springer Publishing Company

ISSN： 1385-3139

Source： Reliable Computing, Vol.10, Iss.6, 2004-12, pp. : 469-487

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the cardinality of the Pareto set in bicriteria shortest path problems

By Müller-Hannemann Matthias  

Annals of Operations Research, Vol. 147, Iss. 1, 2006-10 ,pp. : 269-286

Springer Publishing Company

Access to resources Recommend Favorite

On accuracy of solutions for discrete optimization problems with perturbed coefficientsof the objective function

By Libura M.  

Annals of Operations Research, Vol. 86, Iss. 1, 1999-01 ,pp. : 53-62

Springer Publishing Company

Access to resources Recommend Favorite

On the set of solutions of the open shop problem

By Bräsel H.   Harborth M.   Tautenhahn T.   Willenius P.  

Annals of Operations Research, Vol. 92, Iss. 1, 1999-01 ,pp. : 241-263

Springer Publishing Company

Access to resources Recommend Favorite

An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems

By Dovier Agostino  

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 21, Iss. 2, 2009-06 ,pp. : 79-121

Taylor & Francis Ltd

Access to resources Recommend Favorite

Complete Solutions and Extremality Criteria to Polynomial Optimization Problems

By Gao David  

Journal of Global Optimization, Vol. 35, Iss. 1, 2006-05 ,pp. : 131-143

Springer Publishing Company

Access to resources Recommend Favorite