
Journals in DBLP
Math. Program. 2005, volume: 102, number: 2
 Fabián A. Chudak, David P. Williamson
Improved approximation algorithms for capacitated facility location problems. [Citation Graph (0, 0)][DBLP] Math. Program., 2005, v:102, n:2, pp:207222 [Journal]
 Liqun Qi, Alexander Shapiro, Chen Ling
Differentiability and semismoothness properties of integral functions and their applications. [Citation Graph (0, 0)][DBLP] Math. Program., 2005, v:102, n:2, pp:223248 [Journal]
 Friedrich Eisenbrand, Sören Laue
A linear algorithm for integer programming in the plane. [Citation Graph (0, 0)][DBLP] Math. Program., 2005, v:102, n:2, pp:249259 [Journal]
 Arkadi Nemirovski, Levent Tunçel
"Conefree" primaldual pathfollowing and potentialreduction polynomial time interiorpoint methods. [Citation Graph (0, 0)][DBLP] Math. Program., 2005, v:102, n:2, pp:261294 [Journal]
 Ivo Nowak
Lagrangian decomposition of blockseparable mixedinteger allquadratic programs. [Citation Graph (0, 0)][DBLP] Math. Program., 2005, v:102, n:2, pp:295312 [Journal]
 Justo Puerto, Arie Tamir
Locating treeshaped facilities using the ordered median objective. [Citation Graph (0, 0)][DBLP] Math. Program., 2005, v:102, n:2, pp:313338 [Journal]
 Akihisa Tamura
Coordinatewise domain scaling algorithm for Mconvex function minimization. [Citation Graph (0, 0)][DBLP] Math. Program., 2005, v:102, n:2, pp:339354 [Journal]
 Ramkumar Ramaswamy, James B. Orlin, Nilopal Chakravarti
Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs. [Citation Graph (0, 0)][DBLP] Math. Program., 2005, v:102, n:2, pp:355369 [Journal]
 Martine Labbé, Hande Yaman, Eric Gourdin
A branch and cut algorithm for hub location problems with single assignment. [Citation Graph (0, 0)][DBLP] Math. Program., 2005, v:102, n:2, pp:371405 [Journal]
