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

Author： Williams J.C.   ReVelle C.S.  

Publisher： Elsevier

ISSN： 0377-2217

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

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

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

By Mavrotas G.   Diakoulaki D.  

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

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

Multiobjective programming methods in the reserve selection problem

By Memtsas D.P.  

European Journal of Operational Research, Vol. 150, Iss. 3, 2003-11 ,pp. : 640-652

Elsevier

Access to resources Recommend Favorite

An approximate approach of global optimization for polynomial programming problems

By Li H.-L.   Chang C.-T.  

European Journal of Operational Research, Vol. 107, Iss. 3, 1998-06 ,pp. : 625-632

Elsevier

Access to resources Recommend Favorite