Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.147, Iss.3, 2003-06, pp. : 657-664

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

Combining discriminant methods in solving classification problems in two-group discriminant analysis

By Lam K.F. Moy J.W.

European Journal of Operational Research, Vol. 138, Iss. 2, 2002-04 ,pp. : 294-301

Elsevier

Access to resources Recommend Favorite

Solving some lexicographic multi-objective combinatorial problems

By Volgenant A.

European Journal of Operational Research, Vol. 139, Iss. 3, 2002-06 ,pp. : 578-584

Elsevier

Access to resources Recommend Favorite

A new approach for solving repair limit problems

By Dagpunar J.S.

European Journal of Operational Research, Vol. 113, Iss. 1, 1999-02 ,pp. : 137-146

Elsevier

Access to resources Recommend Favorite

A comparison of two algorithms for solving closed crack problems

By DeBremaecker

Engineering Fracture Mechanics, Vol. 66, Iss. 6, 2000-08 ,pp. : 601-605

Elsevier

Access to resources Recommend Favorite

Solving short-term electric hydrothermal scheduling problems by exponential multiplier methods

By Mijangos Eugenio

Engineering Optimization, Vol. 40, Iss. 6, 2008-06 ,pp. : 505-515

Taylor & Francis Ltd

Access to resources Recommend Favorite