Solving the p-Median Problem with a Semi-Lagrangian Relaxation

By Beltran C.   Tadonki C.   Vial J.  

Computational Optimization and Applications, Vol. 35, Iss. 2, 2006-10 ,pp. : 239-260

Springer Publishing Company

Access to resources Recommend Favorite

Analysis of Decomposition Algorithms with Benders Cuts for p-Median Problem

By Kolokolov Alexander   Kosarev Nikolay  

Journal of Mathematical Modelling and Algorithms, Vol. 5, Iss. 2, 2006-06 ,pp. : 189-199

Springer Publishing Company

Access to resources Recommend Favorite

Exact and heuristic algorithms for solving the generalized minimum filter placement problem

By Mofya E.   Smith J.  

Journal of Combinatorial Optimization, Vol. 12, Iss. 3, 2006-11 ,pp. : 231-256

Springer Publishing Company

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

Another Approach to Solving A = mP for Triangles

By Leong Tom   Bailey Dionne T.   Campbell Elsie M.   Diminnie Charles R.   Swets Paul K.  

Mathematics Magazine, Vol. 80, Iss. 5, 2007-12 ,pp. : 363-368

Mathematical Association of America

Access to resources Recommend Favorite