On Weighted vs Unweighted Versions of Combinatorial Optimization Problems

Author： Crescenzi P.   Silvestri R.   Trevisan L.  

Publisher： Academic Press

ISSN： 0890-5401

Source： Information and Computation, Vol.167, Iss.1, 2001-05, pp. : 10-26

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

Cones of multipowers and combinatorial optimization problems

By Vyalyi M.  

Computational Mathematics and Mathematical Physics, Vol. 53, Iss. 5, 2013-05 ,pp. : 647-654

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Approximating Unweighted Connectivity Problems in Parallel

By Chen Z-Z.  

Information and Computation, Vol. 171, Iss. 2, 2001-12 ,pp. : 125-136

Academic Press

Access to resources Recommend Favorite

New Rollout Algorithms for Combinatorial Optimization Problems

By Guerriero F.   Mancini M.   Musmanno R.  

Optimization Methods and Software, Vol. 17, Iss. 4, 2002-01 ,pp. : 627-654

Taylor & Francis Ltd

Access to resources Recommend Favorite

Solution of Euclidean combinatorial optimization problems by the method of construction of a lexicographic equivalence

By Yemets O.   Barbolina T.  

Cybernetics and Systems Analysis, Vol. 40, Iss. 5, 2004-09 ,pp. : 726-734

Springer Publishing Company

Access to resources Recommend Favorite

Vector optimization problems with linear criteria over a fuzzy combinatorial set of alternatives

By Semenova N.  

Cybernetics and Systems Analysis, Vol. 47, Iss. 2, 2011-03 ,pp. : 250-259

Springer Publishing Company

Access to resources Recommend Favorite