Solving zero-one mixed integer programming problems using tabu search

Author： Lokketangen A.   Glover F.  

Publisher： Elsevier

ISSN： 0377-2217

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

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

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

A simple Tabu Search method to solve the mixed-integer linear bilevel programming problem

By U. P.W.   A. D.H.  

European Journal of Operational Research, Vol. 88, Iss. 3, 1996-02 ,pp. : 563-571

Elsevier

Access to resources Recommend Favorite

Conflict graphs in solving integer programming problems

By Atamturk A.   Nemhauser G.L.   Savelsbergh M.W.P.  

European Journal of Operational Research, Vol. 121, Iss. 1, 2000-02 ,pp. : 40-55

Elsevier

Access to resources Recommend Favorite

A note on a decision support system for multiobjective integer and mixed-integer programming problems

By Alves M.J.   Climaco J.  

European Journal of Operational Research, Vol. 155, Iss. 1, 2004-05 ,pp. : 258-265

Elsevier

Access to resources Recommend Favorite

Scheduling staff using mixed integer programming

By Beaumont N.  

European Journal of Operational Research, Vol. 98, Iss. 3, 1997-05 ,pp. : 473-484

Elsevier

Access to resources Recommend Favorite