Search results for "IPCO"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Thomas L. Magnanti, Dan Stratila	Separable Concave Optimization Approximately Equals Piecewise Linear Optimization.	IPCO	2004	DBLP DOI BibTeX RDF
1	Tamás Király, Márton Makai	On Polyhedra Related to Even Factors.	IPCO	2004	DBLP DOI BibTeX RDF
1	Stéphane Bessy, Stéphan Thomassé	Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs.	IPCO	2004	DBLP DOI BibTeX RDF
1	András Sebö, László Szegö	The Path-Packing Structure of Graphs.	IPCO	2004	DBLP DOI BibTeX RDF
1	Sanjeeb Dash, Oktay Günlük	Valid Inequalities Based on Simple Mixed-Integer Sets.	IPCO	2004	DBLP DOI BibTeX RDF
1	Dimitris Bertsimas, Aurélie Thiele	A Robust Optimization Approach to Supply Chain Management.	IPCO	2004	DBLP DOI BibTeX RDF
1	Dmitrii Lozovanu	Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games.	IPCO	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.	IPCO	2004	DBLP DOI BibTeX RDF
1	Nicola Apollonio, András Sebö	Minsquare Factors and Maxfix Covers of Graphs.	IPCO	2004	DBLP DOI BibTeX RDF
1	Georgia Perakis	The Price of Anarchy when Costs Are Non-separable and Asymmetric.	IPCO	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.	IPCO	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.	IPCO	2004	DBLP DOI BibTeX RDF
1	Antonio Frangioni, Andrea Lodi 0001, Giovanni Rinaldi	Optimizing over Semimetric Polytopes.	IPCO	2004	DBLP DOI BibTeX RDF
1	Asaf Levin, Gerhard J. Woeginger	The Constrained Minimum Weighted Sum of Job Completion Times Problem.	IPCO	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.	IPCO	2004	DBLP DOI BibTeX RDF
1	Volker Kaibel	Low-Dimensional Faces of Random 0/1-Polytopes.	IPCO	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.	IPCO	2004	DBLP DOI BibTeX RDF
1	Jay Sethuraman, Chung-Piaw Teo, Rakesh Vohra	Integer Programming and Arrovian Social Welfare Functions.	IPCO	2002	DBLP DOI BibTeX RDF
1	F. Bruce Shepherd, Adrian Vetta	The Demand Matching Problem.	IPCO	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.	IPCO	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.	IPCO	2002	DBLP DOI BibTeX RDF
1	René Sitters	The Minimum Latency Problem Is NP-Hard for Weighted Trees.	IPCO	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.	IPCO	2002	DBLP DOI BibTeX RDF
1	Andreas Eisenblätter	The Semidefinite Relaxation of the k -Partition Polytope Is Strong.	IPCO	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.	IPCO	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.	IPCO	2002	DBLP DOI BibTeX RDF
1	Karen I. Aardal, Arjen K. Lenstra	Hard Equality Constrained Integer Knapsacks.	IPCO	2002	DBLP DOI BibTeX RDF
1	Ravi Ramamoorthi, Amitabh Sinha II	Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design.	IPCO	2002	DBLP DOI BibTeX RDF
1	Oktay Günlük	A New Min-Cut Max-Flow Ratio for Multicommodity Flows.	IPCO	2002	DBLP DOI BibTeX RDF
1	Kunal Talwar	The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap.	IPCO	2002	DBLP DOI BibTeX RDF
1	Maxim Sviridenko	An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem.	IPCO	2002	DBLP DOI BibTeX RDF
1	Ron Aharoni, Tamás Fleiner	On a Lemma of Scarf.	IPCO	2002	DBLP DOI BibTeX RDF
1	Bianca Spille, Robert Weismantel	A Generalization of Edmonds' Matching and Matroid Intersection Algorithms.	IPCO	2002	DBLP DOI BibTeX RDF
1	Adam N. Letchford, Andrea Lodi 0001	Polynomial-Time Separation of Simple Comb Inequalities.	IPCO	2002	DBLP DOI BibTeX RDF
1	Kent Andersen, Gérard Cornuéjols, Yanjun Li	Split Closure and Intersection Cuts.	IPCO	2002	DBLP DOI BibTeX RDF
1	Ari Freund 0001, Joseph Naor	Approximating the Advertisement Placement Problem.	IPCO	2002	DBLP DOI BibTeX RDF
1	Ernst Althaus, Christian Fink	A Polyhedral Approach to Surface Reconstruction from Planar Contours.	IPCO	2002	DBLP DOI BibTeX RDF
1	Klaus Michael Wenger	A New Approach to Cactus Construction Applied to TSP Support Graphs.	IPCO	2002	DBLP DOI BibTeX RDF
1	Satoru Iwata 0001	A Faster Scaling Algorithm for Minimizing Submodular Functions.	IPCO	2002	DBLP DOI BibTeX RDF
1	Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani	Improved Approximation Algorithms for Resource Allocation.	IPCO	2002	DBLP DOI BibTeX RDF
1	Chandra Chekuri, Anupam Gupta 0001, Amit Kumar 0001, Joseph Naor, Danny Raz	Building Edge-Failure Resilient Networks.	IPCO	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	IPCO	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.	IPCO	2002	DBLP DOI BibTeX RDF
1	Sylvia C. Boyd, Geneviève Labonté	Finding the Exact Integrality Gap for Small Traveling Salesman Problems.	IPCO	2002	DBLP DOI BibTeX RDF
1	Alexander I. Barvinok, Tamon Stephen	The Distribution of Values in the Quadratic Assignment Problem.	IPCO	2002	DBLP DOI BibTeX RDF
1	Ismael R. de Farias Jr., George L. Nemhauser	A Polyhedral Study of the Cardinality Constrained Knapsack Problem.	IPCO	2002	DBLP DOI BibTeX RDF
1	Sanjeeb Dash	An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs.	IPCO	2002	DBLP DOI BibTeX RDF
1	Lisa Fleischer, Martin Skutella	The Quickest Multicommodity Flow Problem.	IPCO	2002	DBLP DOI BibTeX RDF
1	Akihisa Tamura	A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization.	IPCO	2002	DBLP DOI BibTeX RDF
1	Klaus Jansen, Lorant Porkolab	On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes.	IPCO	2002	DBLP DOI BibTeX RDF
1	Diego Klabjan	A New Subadditive Approach to Integer Programming.	IPCO	2002	DBLP DOI BibTeX RDF
1	Bertrand Guenin	Integral Polyhedra Related to Even Cycle and Even Cut Matroids.	IPCO	2001	DBLP DOI BibTeX RDF
1	Clifford Stein 0001, David P. Wagner	Approximation Algorithms for the Minimum Bends Traveling Salesman Problem.	IPCO	2001	DBLP DOI BibTeX RDF
1	András Frank, Tamás Király	Combined Connectivity Augmentation and Orientation Problems.	IPCO	2001	DBLP DOI BibTeX RDF
1	Jean B. Lasserre	An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs.	IPCO	2001	DBLP DOI BibTeX RDF
1	Eran Halperin, Uri Zwick	A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems.	IPCO	2001	DBLP DOI BibTeX RDF
1	Friedrich Eisenbrand, Günter Rote	Fast 2-Variable Integer Programming.	IPCO	2001	DBLP DOI BibTeX RDF
1	Satoru Fujishige, Satoru Iwata 0001	Bisubmodular Function Minimization.	IPCO	2001	DBLP DOI BibTeX RDF
1	Alantha Newman, Santosh S. Vempala	Fences Are Futile: On Relaxations for the Linear Ordering Problem.	IPCO	2001	DBLP DOI BibTeX RDF
1	Michael Perregaard, Egon Balas	Generating Cuts from Multiple-Term Disjunctions.	IPCO	2001	DBLP DOI BibTeX RDF
1	Michael Elkin, David Peleg	Approximating k-Spanner Problems for k>2.	IPCO	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	IPCO	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.	IPCO	2001	DBLP DOI BibTeX RDF
1	Yossi Azar, Oded Regev 0001	Strongly Polynomial Algorithms for the Unsplittable Flow Problem.	IPCO	2001	DBLP DOI BibTeX RDF
1	Refael Hassin, Asaf Levin	Synthesis of 2-Commodity Flow Networks.	IPCO	2001	DBLP DOI BibTeX RDF
1	Maurice Queyranne, Maxim Sviridenko	A (2+epsilon)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective.	IPCO	2001	DBLP DOI BibTeX RDF
1	András Frank, László Szegö	An Extension of a Theorem of Henneberg and Laman.	IPCO	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.	IPCO	2001	DBLP DOI BibTeX RDF
1	René Sitters	Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines.	IPCO	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.	IPCO	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.	IPCO	2001	DBLP DOI BibTeX RDF
1	Garud Iyengar, Mehmet Tolga Çezik	Cutting Planes for Mixed 0-1 Semidefinite Programs.	IPCO	2001	DBLP DOI BibTeX RDF
1	Bertrand Guenin	Circuit Mengerian Directed Graphs.	IPCO	2001	DBLP DOI BibTeX RDF
1	András Sebö, Eric Tannier	Connected Joins in Graphs.	IPCO	2001	DBLP DOI BibTeX RDF
1	Tamás Fleiner	A Matroid Generalization of the Stable Matching Polytope.	IPCO	2001	DBLP DOI BibTeX RDF
1	François Margot	Pruning by Isomorphism in Branch-and-Cut.	IPCO	2001	DBLP DOI BibTeX RDF
1	Gérard Cornuéjols, Yanjun Li	On the Rank of Mixed 0, 1 Polyhedra.	IPCO	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.	IPCO	2001	DBLP DOI BibTeX RDF
1	Petra Schuurman, Tjark Vredeveld	Performance Guarantees of Local Search for Multiprocessor Scheduling.	IPCO	2001	DBLP DOI BibTeX RDF
1	Aaron Archer	Two O (log* k)-Approximation Algorithms for the Asymmetric k-Center Problem.	IPCO	2001	DBLP DOI BibTeX RDF
1	Lisa Fleischer	A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity.	IPCO	2001	DBLP DOI BibTeX RDF
1	Joseph Cheriyan, Santosh S. Vempala	Edge Covers of Setpairs and the Iterative Rounding Method.	IPCO	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.	IPCO	2001	DBLP DOI BibTeX RDF
1	Bill Jackson, Tibor Jordán	Independence Free Graphs and Vertex Connectivity Augmentation.	IPCO	2001	DBLP DOI BibTeX RDF
1	William H. Cunningham, Lawrence Tang	Optimal 3-Terminal Cuts and Linear Programming.	IPCO	1999	DBLP DOI BibTeX RDF
1	Gunnar W. Klau, Petra Mutzel	Optimal Compaction of Orthogonal Grid Drawings.	IPCO	1999	DBLP DOI BibTeX RDF
1	Mark E. Hartmann, Maurice Queyranne, Yaoguang Wang	On the Chvátal Rank of Certain Inequalities.	IPCO	1999	DBLP DOI BibTeX RDF
1	Hiroshi Nagamochi, Toshihide Ibaraki	A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts.	IPCO	1999	DBLP DOI BibTeX RDF
1	Eran Halperin, Uri Zwick	Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs.	IPCO	1999	DBLP DOI BibTeX RDF
1	Vardges Melkonian, Éva Tardos	Approximation Algorithms for a Directed Network Design Problem.	IPCO	1999	DBLP DOI BibTeX RDF
1	Dragos M. Cvetkovic, Mirjana Cangalovic, Vera Kovacevic-Vujcic	Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem.	IPCO	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.	IPCO	1999	DBLP DOI BibTeX RDF
1	Lisa Fleischer	Universally Maximum Flow with Piecewise-Constant Capacities.	IPCO	1999	DBLP DOI BibTeX RDF
1	Stavros G. Kolliopoulos, Clifford Stein 0001	Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow.	IPCO	1999	DBLP DOI BibTeX RDF
1	András Frank, Tibor Jordán, Zoltán Szigeti	An Orientation Theorem with Parity Conditions.	IPCO	1999	DBLP DOI BibTeX RDF
1	Chung-Piaw Teo, Jay Sethuraman, Wee-Peng Tan	Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications.	IPCO	1999	DBLP DOI BibTeX RDF
1	András Sebö	An Introduction to Empty Lattice Simplices.	IPCO	1999	DBLP DOI BibTeX RDF
1	Jean Fonlupt, Ali Ridha Mahjoub	Critical Extreme Points of the 2-Edge Connected Spanning Subgraph Polytope.	IPCO	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.	IPCO	1999	DBLP DOI BibTeX RDF
1	Friedrich Eisenbrand, Andreas S. Schulz	Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube.	IPCO	1999	DBLP DOI BibTeX RDF

Publications at "IPCO"( http://dblp.L3S.de/Venues/IPCO )