Branch-and-Cut-and-Price for Capacitated Connected Facility Location

ISSN： 1570-1166

Source： Journal of Mathematical Modelling and Algorithms, Vol.10, Iss.3, 2011-09, pp. : 245-267

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

Branch‐and‐cut and Branch‐and‐cut‐and‐price algorithms for the adjacent only quadratic minimum spanning tree problem

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 4, 2015-07 ,pp. : 367-379

John Wiley & Sons Inc

Access to resources Recommend Favorite

The branch and cut method for the facility location problem with client's preferences

By Vasilyev I.

Journal of Applied and Industrial Mathematics, Vol. 4, Iss. 3, 2010-07 ,pp. : 441-454

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

A cutting plane algorithm for the capacitated facility location problem

By Avella Pasquale Boccia Maurizio

Computational Optimization and Applications, Vol. 43, Iss. 1, 2009-05 ,pp. : 39-65

Springer Publishing Company

Access to resources Recommend Favorite

An approximation algorithm for the k-level capacitated facility location problem

By Du Donglei Wang Xing Xu Dachuan

Journal of Combinatorial Optimization, Vol. 20, Iss. 4, 2010-11 ,pp. : 361-368

Springer Publishing Company

Access to resources Recommend Favorite

Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem

By Pimentel Carina Maria Oliveira Alvelos Filipe Pereira Valerio de Carvalho Jose

Optimization Methods and Software, Vol. 25, Iss. 2, 2010-04 ,pp. : 299-319

Taylor & Francis Ltd

Access to resources Recommend Favorite