×

zbMATH — the first resource for mathematics

Integer programming and combinatorial optimization. 9th international IPCO conference, Cambridge, MA, USA, May 27–29, 2002. Proceedings. (English) Zbl 0992.00060
Lecture Notes in Computer Science. 2337. Berlin: Springer. xi, 487 p. (2002).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. The preceding conference (8th, 2001) has been reviewed (see Zbl 0967.00091).
Indexed articles:
Iwata, Satoru, A faster scaling algorithm for minimizing submodular functions, 1-8 [Zbl 1049.90530]
Spille, Bianca; Weismantel, Robert, A generalization of Edmonds’ matching and matroid intersection algorithms, 9-20 [Zbl 1049.90079]
Tamura, Akihisa, A coordinatewise domain scaling algorithm for M-convex function minimization, 21-35 [Zbl 1049.90532]
Fleischer, Lisa; Skutella, Martin, The quickest multicommodity flow problem, 36-53 [Zbl 1049.90106]
Günlük, Oktay, A new min-cut max-flow ratio for multicommodity flows, 54-66 [Zbl 1049.90108]
Lewin, Michael; Livnat, Dror; Zwick, Uri, Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems, 67-82 [Zbl 1049.90535]
Boyd, Sylvia; Labonté, Geneviève, Finding the exact integrality gap for small traveling salesman problems, 83-92 [Zbl 1049.90103]
Letchford, Adam N.; Lodi, Andrea, Polynomial-time separation of simple comb inequalities, 93-108 [Zbl 1049.90046]
Wenger, Klaus M., A new approach to cactus construction applied to TSP support graphs, 109-126 [Zbl 1049.90113]
Andersen, Kent; Cornuéjols, Gérard; Li, Yanjun, Split closure and intersection cuts, 127-144 [Zbl 1049.90071]
Dash, Sanjeeb, An exponential lower bound on the length of some classes of branch-and-cut proofs, 145-160 [Zbl 1049.90523]
Richard, Jean-Philippe P.; de Farias, Ismael R. jun.; Nemhauser, George L., Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms, 161-175 [Zbl 1049.90041]
Aharoni, Ron; Fleiner, Tamás, On a lemma of Scarf, 176-187 [Zbl 1049.90070]
Guenin, Bertrand, A short proof of Seymour’s characterization of the matroids with the max-flow min-cut property, 188-193 [Zbl 1049.90529]
Sethuraman, Jay; Teo, Chung-Piaw; Vohra, Rakesh V., Integer programming and arrovian social welfare functions, 194-211 [Zbl 1049.91041]
Ravi, Ramamoorthi; Sinha, Amitabh, Integrated logistics: Approximation algorithms combining facility location and network design, 212-229 [Zbl 1049.90519]
Sitters, René, The minimum latency problem is NP-hard for weighted trees, 230-239 [Zbl 1049.90531]
Sviridenko, Maxim, An improved approximation algorithm for the metric uncapacitated facility location problem, 240-257 [Zbl 1049.90520]
Althaus, Ernst; Fink, Christian, A polyhedral approach to surface reconstruction from planar contours, 258-272 [Zbl 1049.90538]
Eisenblätter, Andreas, The semidefinite relaxation of the \(k\)-partition polytope is strong, 273-290 [Zbl 1049.90136]
de Farias, Ismael R. jun.; Nemhauser, George L., A polyhedral study of the cardinality constrained knapsack problem, 291-303 [Zbl 1049.90082]
Cai, Mao-Cheng; Deng, Xiaotie; Feng, Haodi; Li, Guojun; Liu, Guizhen, A PTAS for minimizing total completion time of bounded batch scheduling, 304-314 [Zbl 1049.90021]
Caprara, Alberto; Lodi, Andrea; Monaci, Michele, An approximation scheme for the two-stage, two-dimensional bin packing problem, 315-328 [Zbl 1049.90044]
Jansen, Klaus; Porkolab, Lorant, On preemptive resource constrained scheduling: Polynomial-time approximation schemes, 329-349 [Zbl 1049.90025]
Aardal, Karen; Lenstra, Arjen K., Hard equality constrained integer knapsacks, 350-366 [Zbl 1049.90042]
Barvinok, Alexander; Stephen, Tamon, The distribution of values in the quadratic assignment problem, 367-383 [Zbl 1049.90033]
Klabjan, Diego, A new subadditive approach to integer programming, 384-400 [Zbl 1049.90045]
Calinescu, Gruia; Chakrabarti, Amit; Karloff, Howard; Rabani, Yuval, Improved approximation algorithms for resource allocation, 401-414 [Zbl 1049.90035]
Freund, Ari; Naor, Joseph (Seffi), Approximating the advertisement placement problem, 415-424 [Zbl 1049.90518]
Gandhi, Rajiv; Khuller, Samir; Kim, Yoo-Ah; Wan, Yung-Chun (Justin), Algorithms for minimizing response time in broadcast scheduling, 425-438 [Zbl 1049.90510]
Chekuri, Chandra; Gupta, Anupam; Kumar, Amit; Naor, Joseph (Seffi); Raz, Danny, Building edge-failure resilient networks, 439-456 [Zbl 1049.90505]
Shepherd, Bruce; Vetta, Adrian, The demand matching problem, 457-474 [Zbl 1049.90112]
Talwar, Kunal, The single-sink buy-at-bulk LP has constant integrality gap, 475-486 [Zbl 1049.90011]

MSC:
00B25 Proceedings of conferences of miscellaneous specific interest
90-06 Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming
PDF BibTeX XML Cite
Full Text: DOI