Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Thomas L. Magnanti, Dan Stratila |
Separable Concave Optimization Approximately Equals Piecewise Linear Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, pp. 234-243, 2004, Springer, 3-540-22113-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Tamás Király, Márton Makai |
On Polyhedra Related to Even Factors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, pp. 416-430, 2004, Springer, 3-540-22113-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Stéphane Bessy, Stéphan Thomassé |
Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, pp. 132-138, 2004, Springer, 3-540-22113-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
1 | András Sebö, László Szegö |
The Path-Packing Structure of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, pp. 256-270, 2004, Springer, 3-540-22113-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Sanjeeb Dash, Oktay Günlük |
Valid Inequalities Based on Simple Mixed-Integer Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, pp. 33-45, 2004, Springer, 3-540-22113-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Dimitris Bertsimas, Aurélie Thiele |
A Robust Optimization Approach to Supply Chain Management. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, pp. 86-100, 2004, Springer, 3-540-22113-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Dmitrii Lozovanu |
Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, pp. 74-85, 2004, Springer, 3-540-22113-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Eyjolfur Ingi Asgeirsson, Jonathan W. Berry, Cynthia A. Phillips, David J. Phillips, Clifford Stein 0001, Joel Wein |
Scheduling an Industrial Production Facility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, pp. 116-131, 2004, Springer, 3-540-22113-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Nicola Apollonio, András Sebö |
Minsquare Factors and Maxfix Covers of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, pp. 388-400, 2004, Springer, 3-540-22113-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Georgia Perakis |
The Price of Anarchy when Costs Are Non-separable and Asymmetric. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, pp. 46-58, 2004, Springer, 3-540-22113-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
System and User-Optimization, Price of Anarchy, Traffic Equilibrium |
1 | Ismael R. de Farias Jr. |
Semi-continuous Cuts for Mixed-Integer Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, pp. 163-177, 2004, Springer, 3-540-22113-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
semi-continuous variables, mixed-integer programming, branch-and-cut, polyhedral combinatorics, disjunctive programming |
1 | Alexander V. Karzanov |
Integer Concave Cocirculations and Honeycombs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, pp. 368-387, 2004, Springer, 3-540-22113-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Antonio Frangioni, Andrea Lodi 0001, Giovanni Rinaldi |
Optimizing over Semimetric Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, pp. 431-443, 2004, Springer, 3-540-22113-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Asaf Levin, Gerhard J. Woeginger |
The Constrained Minimum Weighted Sum of Job Completion Times Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, pp. 298-307, 2004, Springer, 3-540-22113-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
bicriteria optimization, scheduling, approximation scheme |
1 | José R. Correa, Andreas S. Schulz |
Single Machine Scheduling with Precedence Constraints: Extended Abstract. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, pp. 283-297, 2004, Springer, 3-540-22113-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Volker Kaibel |
Low-Dimensional Faces of Random 0/1-Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, pp. 401-415, 2004, Springer, 3-540-22113-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan |
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, pp. 152-162, 2004, Springer, 3-540-22113-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
1 | Jay Sethuraman, Chung-Piaw Teo, Rakesh Vohra |
Integer Programming and Arrovian Social Welfare Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 194-211, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | F. Bruce Shepherd, Adrian Vetta |
The Demand Matching Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 457-474, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Mao-cheng Cai, Xiaotie Deng, Haodi Feng, Guojun Li, Guizhen Liu |
A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 304-314, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Bertrand Guenin |
A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 188-193, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | René Sitters |
The Minimum Latency Problem Is NP-Hard for Weighted Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 230-239, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Alberto Caprara, Andrea Lodi 0001, Michele Monaci |
An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 315-328, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Eisenblätter |
The Semidefinite Relaxation of the k -Partition Polytope Is Strong. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 273-290, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Michael Lewin, Dror Livnat, Uri Zwick |
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 67-82, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser |
Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 161-175, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Karen I. Aardal, Arjen K. Lenstra |
Hard Equality Constrained Integer Knapsacks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 350-366, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Ravi Ramamoorthi, Amitabh Sinha II |
Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 212-229, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Oktay Günlük |
A New Min-Cut Max-Flow Ratio for Multicommodity Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 54-66, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Kunal Talwar |
The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 475-486, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Maxim Sviridenko |
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 240-257, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Ron Aharoni, Tamás Fleiner |
On a Lemma of Scarf. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 176-187, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Bianca Spille, Robert Weismantel |
A Generalization of Edmonds' Matching and Matroid Intersection Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 9-20, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Adam N. Letchford, Andrea Lodi 0001 |
Polynomial-Time Separation of Simple Comb Inequalities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 93-108, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Kent Andersen, Gérard Cornuéjols, Yanjun Li |
Split Closure and Intersection Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 127-144, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Ari Freund 0001, Joseph Naor |
Approximating the Advertisement Placement Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 415-424, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Ernst Althaus, Christian Fink |
A Polyhedral Approach to Surface Reconstruction from Planar Contours. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 258-272, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Klaus Michael Wenger |
A New Approach to Cactus Construction Applied to TSP Support Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 109-126, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Satoru Iwata 0001 |
A Faster Scaling Algorithm for Minimizing Submodular Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 1-8, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani |
Improved Approximation Algorithms for Resource Allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 401-414, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Chandra Chekuri, Anupam Gupta 0001, Amit Kumar 0001, Joseph Naor, Danny Raz |
Building Edge-Failure Resilient Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 439-456, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | William J. Cook, Andreas S. Schulz (eds.) |
Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![Springer, 3-540-43676-6 The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Rajiv Gandhi, Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan |
Algorithms for Minimizing Response Time in Broadcast Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 425-438, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Sylvia C. Boyd, Geneviève Labonté |
Finding the Exact Integrality Gap for Small Traveling Salesman Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 83-92, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Alexander I. Barvinok, Tamon Stephen |
The Distribution of Values in the Quadratic Assignment Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 367-383, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Ismael R. de Farias Jr., George L. Nemhauser |
A Polyhedral Study of the Cardinality Constrained Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 291-303, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Sanjeeb Dash |
An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 145-160, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Lisa Fleischer, Martin Skutella |
The Quickest Multicommodity Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 36-53, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Akihisa Tamura |
A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 21-35, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Klaus Jansen, Lorant Porkolab |
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 329-349, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Diego Klabjan |
A New Subadditive Approach to Integer Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 384-400, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
1 | Bertrand Guenin |
Integral Polyhedra Related to Even Cycle and Even Cut Matroids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 196-209, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Clifford Stein 0001, David P. Wagner |
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 406-422, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | András Frank, Tamás Király |
Combined Connectivity Augmentation and Orientation Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 130-144, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Jean B. Lasserre |
An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 293-303, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Eran Halperin, Uri Zwick |
A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 210-225, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Friedrich Eisenbrand, Günter Rote |
Fast 2-Variable Integer Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 78-89, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Satoru Fujishige, Satoru Iwata 0001 |
Bisubmodular Function Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 160-169, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Alantha Newman, Santosh S. Vempala |
Fences Are Futile: On Relaxations for the Linear Ordering Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 333-347, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Michael Perregaard, Egon Balas |
Generating Cuts from Multiple-Term Disjunctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 348-360, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Michael Elkin, David Peleg |
Approximating k-Spanner Problems for k>2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 90-104, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Karen I. Aardal, Bert Gerards (eds.) |
Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![Springer, 3-540-42225-0 The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Naveen Garg 0001, Rohit Khandekar, Goran Konjevod, R. Ravi 0001, F. Sibel Salman, Amitabh Sinha II |
On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 170-184, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Yossi Azar, Oded Regev 0001 |
Strongly Polynomial Algorithms for the Unsplittable Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 15-29, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Refael Hassin, Asaf Levin |
Synthesis of 2-Commodity Flow Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 226-235, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Maurice Queyranne, Maxim Sviridenko |
A (2+epsilon)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 361-369, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | András Frank, László Szegö |
An Extension of a Theorem of Henneberg and Laman. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 145-159, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
constructive characterization, packing and covering by trees AMS subject classification. 05C40, graph, rigidity |
1 | Murali S. Kodialam |
The Throughput of Sequential Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 280-292, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | René Sitters |
Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 396-405, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | 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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 318-332, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
capacitated lot-sizing, fixed charge network flow, Mixed integer programming, polyhedral combinatorics, production planning, setup times |
1 | Arie Hordijk, D. A. van der Laan |
Bounds for Deterministic Periodic Routing Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 236-250, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Garud Iyengar, Mehmet Tolga Çezik |
Cutting Planes for Mixed 0-1 Semidefinite Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 251-263, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Bertrand Guenin |
Circuit Mengerian Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 185-195, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | András Sebö, Eric Tannier |
Connected Joins in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 383-395, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Tamás Fleiner |
A Matroid Generalization of the Stable Matching Polytope. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 105-114, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | François Margot |
Pruning by Isomorphism in Branch-and-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 304-317, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Gérard Cornuéjols, Yanjun Li |
On the Rank of Mixed 0, 1 Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 71-77, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | 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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 45-59, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Petra Schuurman, Tjark Vredeveld |
Performance Guarantees of Local Search for Multiprocessor Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 370-382, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Aaron Archer |
Two O (log* k)-Approximation Algorithms for the Asymmetric k-Center Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 1-14, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Lisa Fleischer |
A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 115-129, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Joseph Cheriyan, Santosh S. Vempala |
Edge Covers of Setpairs and the Iterative Rounding Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 30-44, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Fabián A. Chudak, Tim Roughgarden, David P. Williamson |
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 60-70, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | Bill Jackson, Tibor Jordán |
Independence Free Graphs and Vertex Connectivity Augmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 264-279, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
1 | William H. Cunningham, Lawrence Tang |
Optimal 3-Terminal Cuts and Linear Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 114-125, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Gunnar W. Klau, Petra Mutzel |
Optimal Compaction of Orthogonal Grid Drawings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 304-319, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Mark E. Hartmann, Maurice Queyranne, Yaoguang Wang |
On the Chvátal Rank of Certain Inequalities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 218-233, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Hiroshi Nagamochi, Toshihide Ibaraki |
A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 377-390, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Eran Halperin, Uri Zwick |
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 202-217, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Vardges Melkonian, Éva Tardos |
Approximation Algorithms for a Directed Network Design Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 345-360, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Dragos M. Cvetkovic, Mirjana Cangalovic, Vera Kovacevic-Vujcic |
Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 126-136, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Traveling salesman problem, Semidefinite programming, Branch-and-bound methods |
1 | Kenji Kashiwabara, Masataka Nakamura, Takashi Takabatake |
Integral Polyhedra Associated with Certain Submodular Functions Defined on 012-Vectors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 289-303, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Lisa Fleischer |
Universally Maximum Flow with Piecewise-Constant Capacities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 151-165, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Stavros G. Kolliopoulos, Clifford Stein 0001 |
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 328-344, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
1 | András Frank, Tibor Jordán, Zoltán Szigeti |
An Orientation Theorem with Parity Conditions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 183-190, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Chung-Piaw Teo, Jay Sethuraman, Wee-Peng Tan |
Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 429-438, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
1 | András Sebö |
An Introduction to Empty Lattice Simplices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 400-414, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Jean Fonlupt, Ali Ridha Mahjoub |
Critical Extreme Points of the 2-Edge Connected Spanning Subgraph Polytope. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 166-182, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
2-edge connected graph, critical extreme point, Polytope, cut |
1 | Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin |
Solving the Convex Cost Integer Dual Network Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 31-44, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
1 | Friedrich Eisenbrand, Andreas S. Schulz |
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 137-150, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|