Conferences in DBLP
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 ] Pasquale Avella , Sara Mattia , Antonio Sassano Metric Inequalities and the Network Loading Problem. [Citation Graph (0, 0)][DBLP ] IPCO, 2004, pp:16-32 [Conf ] 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 ] G. Perakis The Price of Anarchy when Costs Are Non-separable and Asymmetric. [Citation Graph (0, 0)][DBLP ] IPCO, 2004, pp:46-58 [Conf ] 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 ] Dmitrii Lozovanu Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games. [Citation Graph (0, 0)][DBLP ] IPCO, 2004, pp:74-85 [Conf ] Dimitris Bertsimas , Aurélie Thiele A Robust Optimization Approach to Supply Chain Management. [Citation Graph (0, 0)][DBLP ] IPCO, 2004, pp:86-100 [Conf ] R. Ravi , Amitabh Sinha Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems. [Citation Graph (0, 0)][DBLP ] IPCO, 2004, pp:101-115 [Conf ] 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 ] 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 ] Gyula Pap A TDI Description of Restricted 2-Matching Polytopes. [Citation Graph (0, 0)][DBLP ] IPCO, 2004, pp:139-151 [Conf ] 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 ] I. R. de Farias Semi-continuous Cuts for Mixed-Integer Programming. [Citation Graph (0, 0)][DBLP ] IPCO, 2004, pp:163-177 [Conf ] Gianni Codato , Matteo Fischetti Combinatorial Benders' Cuts. [Citation Graph (0, 0)][DBLP ] IPCO, 2004, pp:178-195 [Conf ] 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 ] 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 ] 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 ] Thomas L. Magnanti , Dan Stratila Separable Concave Optimization Approximately Equals Piecewise Linear Optimization. [Citation Graph (0, 0)][DBLP ] IPCO, 2004, pp:234-243 [Conf ] 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 ] András Sebö , László Szegö The Path-Packing Structure of Graphs. [Citation Graph (0, 0)][DBLP ] IPCO, 2004, pp:256-270 [Conf ] Jon Lee , François Margot More on a Binary-Encoded Coloring Formulation. [Citation Graph (0, 0)][DBLP ] IPCO, 2004, pp:271-282 [Conf ] 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 ] 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 ] Jens Vygen Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption. [Citation Graph (0, 0)][DBLP ] IPCO, 2004, pp:308-324 [Conf ] 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 ] 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 ] 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 ] Alexander V. Karzanov Integer Concave Cocirculations and Honeycombs. [Citation Graph (0, 0)][DBLP ] IPCO, 2004, pp:368-387 [Conf ] Nicola Apollonio , András Sebö Minsquare Factors and Maxfix Covers of Graphs. [Citation Graph (0, 0)][DBLP ] IPCO, 2004, pp:388-400 [Conf ] Volker Kaibel Low-Dimensional Faces of Random 0/1-Polytopes. [Citation Graph (0, 0)][DBLP ] IPCO, 2004, pp:401-415 [Conf ] Tamás Király , Márton Makai On Polyhedra Related to Even Factors. [Citation Graph (0, 0)][DBLP ] IPCO, 2004, pp:416-430 [Conf ] Antonio Frangioni , Andrea Lodi , Giovanni Rinaldi Optimizing over Semimetric Polytopes. [Citation Graph (0, 0)][DBLP ] IPCO, 2004, pp:431-443 [Conf ]