The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Ricardo Fukasawa, Jens Lysgaard, Marcus Poggi de Aragão, Marcelo Reis, Eduardo Uchoa, Renato Fonseca F. Werneck
    Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:1-15 [Conf]
  2. Pasquale Avella, Sara Mattia, Antonio Sassano
    Metric Inequalities and the Network Loading Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:16-32 [Conf]
  3. Sanjeeb Dash, Oktay Günlük
    Valid Inequalities Based on Simple Mixed-Integer Sets. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:33-45 [Conf]
  4. G. Perakis
    The Price of Anarchy when Costs Are Non-separable and Asymmetric. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:46-58 [Conf]
  5. José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses
    Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem: Extended Abstract. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:59-73 [Conf]
  6. Dmitrii Lozovanu
    Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:74-85 [Conf]
  7. Dimitris Bertsimas, Aurélie Thiele
    A Robust Optimization Approach to Supply Chain Management. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:86-100 [Conf]
  8. R. Ravi, Amitabh Sinha
    Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:101-115 [Conf]
  9. Eyjolfur Asgeirsson, Jonathan W. Berry, Cynthia A. Phillips, David J. Phillips, Clifford Stein, Joel Wein
    Scheduling an Industrial Production Facility. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:116-131 [Conf]
  10. Stéphane Bessy, Stéphan Thomassé
    Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:132-138 [Conf]
  11. Gyula Pap
    A TDI Description of Restricted 2-Matching Polytopes. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:139-151 [Conf]
  12. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
    Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:152-162 [Conf]
  13. I. R. de Farias
    Semi-continuous Cuts for Mixed-Integer Programming. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:163-177 [Conf]
  14. Gianni Codato, Matteo Fischetti
    Combinatorial Benders' Cuts. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:178-195 [Conf]
  15. Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis
    A Faster Exact Separation Algorithm for Blossom Inequalities. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:196-205 [Conf]
  16. Retsef Levi, David B. Shmoys, Chaitanya Swamy
    LP-based Approximation Algorithms for Capacitated Facility Location. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:206-218 [Conf]
  17. Jiawei Zhang, Bo Chen, Yinyu Ye
    A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:219-233 [Conf]
  18. Thomas L. Magnanti, Dan Stratila
    Separable Concave Optimization Approximately Equals Piecewise Linear Optimization. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:234-243 [Conf]
  19. Jesús A. De Loera, David Haws, Raymond Hemmecke, Peter Huggins, Ruriko Yoshida
    Three Kinds of Integer Programming Algorithms Based on Barvinok's Rational Functions. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:244-255 [Conf]
  20. András Sebö, László Szegö
    The Path-Packing Structure of Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:256-270 [Conf]
  21. Jon Lee, François Margot
    More on a Binary-Encoded Coloring Formulation. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:271-282 [Conf]
  22. José R. Correa, Andreas S. Schulz
    Single Machine Scheduling with Precedence Constraints: Extended Abstract. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:283-297 [Conf]
  23. Asaf Levin, Gerhard J. Woeginger
    The Constrained Minimum Weighted Sum of Job Completion Times Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:298-307 [Conf]
  24. Jens Vygen
    Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:308-324 [Conf]
  25. Kevin Lang, Satish Rao
    A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:325-337 [Conf]
  26. Jesús A. De Loera, Shmuel Onn
    All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:338-351 [Conf]
  27. Satoru Iwata, Satoko Moriguchi, Kazuo Murota
    A Capacity Scaling Algorithm for M-convex Submodular Flow. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:352-367 [Conf]
  28. Alexander V. Karzanov
    Integer Concave Cocirculations and Honeycombs. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:368-387 [Conf]
  29. Nicola Apollonio, András Sebö
    Minsquare Factors and Maxfix Covers of Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:388-400 [Conf]
  30. Volker Kaibel
    Low-Dimensional Faces of Random 0/1-Polytopes. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:401-415 [Conf]
  31. Tamás Király, Márton Makai
    On Polyhedra Related to Even Factors. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:416-430 [Conf]
  32. Antonio Frangioni, Andrea Lodi, Giovanni Rinaldi
    Optimizing over Semimetric Polytopes. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:431-443 [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