Period of time: 2014年1期
Publisher: Elsevier
Founded in: 1971
Total resources: 12
ISSN: 0025-5610
Subject: O Mathematical Sciences and Chemical
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Mathematical Programming,volume 82,issue 1
Menu
Minimizing symmetric submodular functions
Mathematical Programming,volume 82,issue 1 , Vol. 82, Iss. 1, 1998-06 , pp.An efficient approximation algorithm for the survivable network design problem
By Gabow H.N., Goemans M.X., Williamson D.P. in (1998)
Mathematical Programming,volume 82,issue 1 , Vol. 82, Iss. 1, 1998-06 , pp.Random sampling and greedy sparsification for matroid optimization problems
Mathematical Programming,volume 82,issue 1 , Vol. 82, Iss. 1, 1998-06 , pp.Packing algorithms for arborescences (and spanning trees) in capacitated graphs
By Gabow H.N., Manu K.S. in (1998)
Mathematical Programming,volume 82,issue 1 , Vol. 82, Iss. 1, 1998-06 , pp.An improved approximation ratio for the minimum latency problem
By Goemans M., Kleinberg J. in (1998)
Mathematical Programming,volume 82,issue 1 , Vol. 82, Iss. 1, 1998-06 , pp.By Burkard R.E., Cela E., Rote G., Woeginger G.J. in (1998)
Mathematical Programming,volume 82,issue 1 , Vol. 82, Iss. 1, 1998-06 , pp.Base polytopes of series-parallel posets: Linear description and optimization
By Schrader R., Schulz A.S., Wambach G. in (1998)
Mathematical Programming,volume 82,issue 1 , Vol. 82, Iss. 1, 1998-06 , pp.Approximability of flow shop scheduling
Mathematical Programming,volume 82,issue 1 , Vol. 82, Iss. 1, 1998-06 , pp.Makespan minimization in open shops: A polynomial time approximation scheme
By Sevastianov S.V., J. Woeginger G. in (1998)
Mathematical Programming,volume 82,issue 1 , Vol. 82, Iss. 1, 1998-06 , pp.Minimizing average completion time in the presence of release dates
By Phillips C., Stein C., Wein J. in (1998)
Mathematical Programming,volume 82,issue 1 , Vol. 82, Iss. 1, 1998-06 , pp.