A branch and bound algorithm for mixed zero-one multiple objective linear programming

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.107, Iss.3, 1998-06, pp. : 530-541

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

Solving zero-one mixed integer programming problems using tabu search

By Lokketangen A. Glover F.

European Journal of Operational Research, Vol. 106, Iss. 2, 1998-04 ,pp. : 624-658

Elsevier

Access to resources Recommend Favorite

QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm

By Comley W.J.

European Journal of Operational Research, Vol. 95, Iss. 2, 1996-12 ,pp. : 420-426

Elsevier

Access to resources Recommend Favorite

Reserve assemblage of critical areas: A zero-one programming approach

By Williams J.C. ReVelle C.S.

European Journal of Operational Research, Vol. 104, Iss. 3, 1998-02 ,pp. : 497-509

Elsevier

Access to resources Recommend Favorite

A reduction algorithm for integer multiple objective linear programs

By Schweigert D. Neumayer P.

European Journal of Operational Research, Vol. 99, Iss. 2, 1997-06 ,pp. : 459-462

Elsevier

Access to resources Recommend Favorite

Using objective values to start multiple objective linear programming algorithms

By Arbel

European Journal of Operational Research, Vol. 128, Iss. 3, 2001-02 ,pp. : 587-596

Elsevier

Access to resources Recommend Favorite