The SCEAS System
Navigation Menu

Conferences in DBLP

Integer Programming and Combinatorial Optimization (IPCO) (ipco)
2001 (conf/ipco/2001)

  1. Aaron Archer
    Two O (log* k)-Approximation Algorithms for the Asymmetric k-Center Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:1-14 [Conf]
  2. Yossi Azar, Oded Regev
    Strongly Polynomial Algorithms for the Unsplittable Flow Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:15-29 [Conf]
  3. Joseph Cheriyan, Santosh Vempala
    Edge Covers of Setpairs and the Iterative Rounding Method. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:30-44 [Conf]
  4. Cheng-Feng Mabel Chou, Maurice Queyranne, David Simchi-Levi
    The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release Dates. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:45-59 [Conf]
  5. Fabián A. Chudak, Tim Roughgarden, David P. Williamson
    Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:60-70 [Conf]
  6. Gérard Cornuéjols, Yanjun Li
    On the Rank of Mixed 0, 1 Polyhedra. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:71-77 [Conf]
  7. Friedrich Eisenbrand, Günter Rote
    Fast 2-Variable Integer Programming. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:78-89 [Conf]
  8. Michael Elkin, David Peleg
    Approximating k-Spanner Problems for k>2. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:90-104 [Conf]
  9. Tamás Fleiner
    A Matroid Generalization of the Stable Matching Polytope. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:105-114 [Conf]
  10. Lisa Fleischer
    A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:115-129 [Conf]
  11. András Frank, Tamás Király
    Combined Connectivity Augmentation and Orientation Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:130-144 [Conf]
  12. András Frank, László Szegö
    An Extension of a Theorem of Henneberg and Laman. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:145-159 [Conf]
  13. Satoru Fujishige, Satoru Iwata
    Bisubmodular Function Minimization. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:160-169 [Conf]
  14. Naveen Garg, Rohit Khandekar, Goran Konjevod, R. Ravi, F. Sibel Salman, Amitabh Sinha II
    On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:170-184 [Conf]
  15. Bertrand Guenin
    Circuit Mengerian Directed Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:185-195 [Conf]
  16. Bertrand Guenin
    Integral Polyhedra Related to Even Cycle and Even Cut Matroids. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:196-209 [Conf]
  17. Eran Halperin, Uri Zwick
    A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:210-225 [Conf]
  18. Refael Hassin, Asaf Levin
    Synthesis of 2-Commodity Flow Networks. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:226-235 [Conf]
  19. Arie Hordijk, D. A. van der Laan
    Bounds for Deterministic Periodic Routing Sequences. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:236-250 [Conf]
  20. Garud Iyengar, M. T. Çezik
    Cutting Planes for Mixed 0-1 Semidefinite Programs. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:251-263 [Conf]
  21. Bill Jackson, Tibor Jordán
    Independence Free Graphs and Vertex Connectivity Augmentation. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:264-279 [Conf]
  22. Murali S. Kodialam
    The Throughput of Sequential Testing. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:280-292 [Conf]
  23. Jean B. Lasserre
    An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:293-303 [Conf]
  24. François Margot
    Pruning by Isomorphism in Branch-and-Cut. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:304-317 [Conf]
  25. Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh
    Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:318-332 [Conf]
  26. Alantha Newman, Santosh Vempala
    Fences Are Futile: On Relaxations for the Linear Ordering Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:333-347 [Conf]
  27. Michael Perregaard, Egon Balas
    Generating Cuts from Multiple-Term Disjunctions. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:348-360 [Conf]
  28. Maurice Queyranne, Maxim Sviridenko
    A (2+epsilon)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:361-369 [Conf]
  29. Petra Schuurman, Tjark Vredeveld
    Performance Guarantees of Local Search for Multiprocessor Scheduling. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:370-382 [Conf]
  30. András Sebö, Eric Tannier
    Connected Joins in Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:383-395 [Conf]
  31. René Sitters
    Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:396-405 [Conf]
  32. Clifford Stein, David P. Wagner
    Approximation Algorithms for the Minimum Bends Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:406-422 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002