Benders-and-cut algorithm for fixed-charge capacitated network design problem

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.125, Iss.3, 2000-09, pp. : 622-632

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 note on ''a dual-ascent approach to the fixed-charge capacitated network design problem''

By Gendron B.

European Journal of Operational Research, Vol. 138, Iss. 3, 2002-05 ,pp. : 671-675

Elsevier

Access to resources Recommend Favorite

Projections of the capacitated network loading problem

By Mirchandani P.

European Journal of Operational Research, Vol. 122, Iss. 3, 2000-05 ,pp. : 534-560

Elsevier

Access to resources Recommend Favorite

A heuristic algorithm for the Asymmetric Capacitated Vehicle Routing Problem

By Vigo D.

European Journal of Operational Research, Vol. 89, Iss. 1, 1996-02 ,pp. : 108-126

Elsevier

Access to resources Recommend Favorite

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

Capacitated network design considering survivability: an evolutionary approach

By Konak Abdullah

Engineering Optimization, Vol. 36, Iss. 2, 2004-04 ,pp. : 189-205

Taylor & Francis Ltd

Access to resources Recommend Favorite