The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Matteo Fischetti, Cristiano Saturni
    Mixed-Integer Cuts from Cyclic Groups. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:1-11 [Conf]
  2. Matteo Fischetti, Andrea Lodi
    Optimizing over the First Chvàtal Closure. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:12-22 [Conf]
  3. Yongpei Guan, Shabbir Ahmed, George L. Nemhauser
    Sequential Pairing of Mixed Integer Inequalities. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:23-34 [Conf]
  4. Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta
    Approximate Min-max Relations for Odd Cycles in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:35-50 [Conf]
  5. Mohammad R. Salavatipour, Jacques Verstraëte
    Disjoint Cycles: Integrality Gap, Hardness, and Approximation. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:51-65 [Conf]
  6. Gyula Pap
    A Combinatorial Algorithm to Find a Maximum Even Factor. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:66-80 [Conf]
  7. Fabián A. Chudak, Vânia Eleutério
    Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:81-96 [Conf]
  8. Andreas Bley
    On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:97-110 [Conf]
  9. Retsef Levi, Joseph Geunes, H. Edwin Romeijn, David B. Shmoys
    Inventory and Facility Location Models with Market Selection. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:111-124 [Conf]
  10. Anthony Man-Cho So, Jiawei Zhang, Yinyu Ye
    On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:125-135 [Conf]
  11. Nebojsa Gvozdenovic, Monique Laurent
    Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:136-151 [Conf]
  12. G. Iyengar, David J. Phillips, Clifford Stein
    Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:152-166 [Conf]
  13. José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses
    On the Inefficiency of Equilibria in Congestion Games. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:167-181 [Conf]
  14. Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
    Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:182-195 [Conf]
  15. José R. Correa, Michael R. Wagner
    LP-Based Online Scheduling: From Single to Parallel Machines. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:196-209 [Conf]
  16. Bernd Gärtner, Walter D. Morris, Leo Rüst
    Unique Sink Orientations of Grids. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:210-224 [Conf]
  17. Ingo Schurr, Tibor Szabó
    Jumping Doesn't Help in Abstract Cubes. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:225-235 [Conf]
  18. Naonori Kakimura, Satoru Iwata
    Computing the Inertia from Sign Patterns. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:236-248 [Conf]
  19. Edoardo Amaldi, Pietro Belotti, Raphael Hauser
    Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:249-264 [Conf]
  20. Andreas Brandstädt, Chính T. Hoàng
    On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:265-275 [Conf]
  21. Heiko Röglin, Berthold Vöcking
    Smoothed Analysis of Integer Programming. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:276-290 [Conf]
  22. Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura
    Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:291-305 [Conf]
  23. Retsef Levi, Martin Pál, Robin Roundy, David B. Shmoys
    Approximation Algorithms for Stochastic Inventory Control Models. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:306-320 [Conf]
  24. Kedar Dhamdhere, R. Ravi, Mohit Singh
    On Two-Stage Stochastic Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:321-334 [Conf]
  25. Satoru Iwata, Ryo Shimizu
    Combinatorial Analysis of Generic Matrix Pencils. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:335-348 [Conf]
  26. Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov
    Power Optimization for Connectivity Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:349-361 [Conf]
  27. Lap Chi Lau
    Packing Steiner Forests. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:362-376 [Conf]
  28. Alberto Caprara, Marco Locatelli, Michele Monaci
    Bidimensional Packing by Bilinear Programming. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:377-391 [Conf]
  29. Harold N. Gabow
    On the Linfinity-Norm of Extreme Points for Crossing Supermodular Directed Network LPs. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:392-406 [Conf]
  30. Cor A. J. Hurkens, Judith Keijsper, Leen Stougie
    Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:407-421 [Conf]
  31. Prabhakar Gubbala, Balaji Raghavachari
    Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:422-436 [Conf]
  32. Agustin Bompadre, James B. Orlin
    Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:437-451 [Conf]
  33. William Cook, Daniel Espinoza, Marcos Goycoolea
    A Study of Domino-Parity and k-Parity Constraints for the TSP. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:452-467 [Conf]
  34. Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis
    Not Every GTSP Facet Induces an STSP Facet. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:468-482 [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