Efficient cuts in Lagrangean 'Relax-and-Cut' schemes

Author： Guignard M.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.105, Iss.1, 1998-02, pp. : 216-223

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 Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem

By Klose A.  

European Journal of Operational Research, Vol. 126, Iss. 2, 2000-10 ,pp. : 408-421

Elsevier

Access to resources Recommend Favorite

A Lagrangean heuristic for the maximal covering location problem

By Galvao R.D.   ReVelle C.  

European Journal of Operational Research, Vol. 88, Iss. 1, 1996-01 ,pp. : 114-123

Elsevier

Access to resources Recommend Favorite

Lagrangean/surrogate relaxation for generalized assignment problems

By Narciso M.G.   Lorena L.A.N.  

European Journal of Operational Research, Vol. 114, Iss. 1, 1999-04 ,pp. : 165-177

Elsevier

Access to resources Recommend Favorite

A Lagrangean heuristic for the facility location problem with staircase costs

By Holmberg K.   Ling J.  

European Journal of Operational Research, Vol. 97, Iss. 1, 1997-02 ,pp. : 63-74

Elsevier

Access to resources Recommend Favorite

Lagrangean methods for the 0-1 Quadratic Knapsack Problem

By Michelon P.   Veilleux L.  

European Journal of Operational Research, Vol. 92, Iss. 2, 1996-07 ,pp. : 326-341

Elsevier

Access to resources Recommend Favorite