The k-Client Problem

Author： Alborzi H.   Torng E.   Uthaisombut P.   Wagner S.  

Publisher： Elsevier

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.41, Iss.2, 2001-11, pp. : 115-173

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

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

Parallel Asynchronous Algorithms for the K Shortest Paths Problem

By Guerriero F.   Musmanno R.  

Journal of Optimization Theory and Applications, Vol. 104, Iss. 1, 2000-01 ,pp. : 91-108

Springer Publishing Company

Access to resources Recommend Favorite

A branch‐and‐price algorithm for the (k,c)‐coloring problem

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 4, 2015-07 ,pp. : 353-366

John Wiley & Sons Inc

Access to resources Recommend Favorite

Hardness of k-Vertex-Connected Subgraph Augmentation Problem

By Ma Changcun   Kim Donghyun   Wang Yuexuan   Wang Wei   Sohaee Nassim   Wu Weili  

Journal of Combinatorial Optimization, Vol. 20, Iss. 3, 2010-10 ,pp. : 249-258

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