| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Neil Olver, Rico Zenklusen |
Chain-Constrained Spanning Trees.  |
IPCO  |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | David Applegate, Aaron Archer, Vijay Gopalakrishnan, Seungjoon Lee, K. K. Ramakrishnan |
Content Placement via the Exponential Potential Function Method. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Amitabh Basu, Robert Hildebrand, Matthias Köppe |
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem: II. The Unimodular Two-Dimensional Case. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Conforti, Gérard Cornuéjols, Aris Daniilidis, Claude Lemaréchal, Jérôme Malick |
Cut-Generating Functions. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe |
Reverse Chvátal-Gomory Rank. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxim Sviridenko, Andreas Wiese |
Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai |
The Euclidean k-Supplier Problem. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Tasuku Soma |
Fast Deterministic Algorithms for Matrix Completion Problems. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels, Gautier Stauffer |
Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Diego Alejandro Morán Ramírez, Santanu S. Dey |
A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Viswanath Nagarajan, Vijay V. Vazirani |
Thrifty Algorithms for Multistage Robust Optimization. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel X. Goemans, José R. Correa (eds.) |
Integer Programming and Combinatorial Optimization - 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | András Sebö |
Eight-Fifth Approximation for the Path TSP. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Viswanath Nagarajan |
A Stochastic Probing Problem with Applications. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Oktay Günlük, Diego Alejandro Morán Ramirez |
On Some Generalizations of the Split Closure. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese |
Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Kent Andersen, Anders Nedergaard Jensen |
Intersection Cuts for Mixed Integer Conic Quadratic Sets. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Karen Aardal, Frederik von Heymann |
On the Structure of Reduced Kernel Lattice Bases. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Zachary Friggstad, Anupam Gupta, Mohit Singh |
An Improved Integrality Gap for Asymmetric TSP Paths. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Nonner, Maxim Sviridenko |
An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Bertrand Guenin, Leanne Stuive |
Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Z. Chen, Jian Li, Hongyu Liang, Haitao Wang |
Matroid and Knapsack Center Problems. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir |
All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Jaillet, José A. Soto, Rico Zenklusen |
Advances on Matroid Secretary Problems: Free Order Model and Laminar Case. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger |
A Complexity and Approximability Study of the Bilevel Knapsack Problem. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Dinitz, Anupam Gupta |
Packing Interdiction and Partial Covering Problems. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Hongbo Dong, Jeff Linderoth |
On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Rothvoß |
A Simpler Proof for $O(\textrm{Congestion} + \textrm{Dilation})$ Packet Routing. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Moseley, Kirk Pruhs, Cliff Stein |
The Complexity of Scheduling for p-Norms of Flow and Stretch - (Extended Abstract). |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruben Hoeksma, Marc Uetz |
Two Dimensional Optimal Mechanism Design for a Sequencing Problem. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Rothvoß, Laura Sanità |
0/1 Polytopes with Quadratic Chvátal Rank. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Vishnu Narayanan |
Facial Structure and Representation of Integer Hulls of Convex Sets. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Attila Bernáth, Gyula Pap |
Blocking Optimal Arborescences. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Held, Daniel Rotter |
Shallow-Light Steiner Arborescences with Vertex Delays. |
IPCO |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Kaibel, Kanstantsin Pashkovich |
Constructing Extended Formulations from Reflection Relations. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Held, William Cook, Edward C. Sewell |
Safe Lower Bounds for Graph Coloring. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bissan Ghaddar, Juan C. Vera, Miguel F. Anjos |
An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sylvia Boyd, René Sitters, Suzanne van der Ster, Leen Stougie |
TSP on Cubic and Subcubic Graphs. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mathieu Van Vyve |
Fixed-Charge Transportation on a Path: Linear Programming Formulations. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tamás Király, Lap Chi Lau |
Degree Bounded Forest Covering. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma |
On the Chvátal-Gomory Closure of a Compact Convex Set. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Iwata, Mizuyo Takamatsu |
Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenjiro Takazawa |
Optimal Matching Forests and Valuated Delta-Matroids. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Chaitanya Swamy |
Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | William Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter |
An Exact Rational Mixed-Integer Programming Solver. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabrizio Grandoni, Thomas Rothvoß |
Approximation Algorithms for Single and Multi-Commodity Connected Facility Location. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi |
Capacitated Vehicle Routing with Non-uniform Speeds. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Friedmann |
A Subexponential Lower Bound for Zadeh's Pivoting Rule for Solving Linear Programs and Games. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | José A. Soto, Claudio Telha |
Jump Number of Two-Directional Orthogonal Ray Graphs. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß, Laura Sanità |
Set Covering with Ordered Replacement: Additive and Multiplicative Gaps. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula |
Approximability of Capacitated Network Design. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mario Ruthmair, Günther R. Raidl |
A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oktay Günlük, Gerhard J. Woeginger (eds.) |
Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, NY, USA, June 15-17, 2011. Proceedings |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Amitabh Basu, Gérard Cornuéjols, Marco Molinaro |
A Probabilistic Analysis of the Strength of the Split and Triangle Closures. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Trang T. Nguyen, Mohit Tawarmalani, Jean-Philippe P. Richard |
Convexification Techniques for Linear Complementarity Constraints. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Britta Peis, Andreas Wiese |
Universal Packet Routing with Arbitrary Bandwidths and Transit Times. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Aman Dhesi, Pranav Gupta, Amit Kumar, Gyana R. Parija, Sambuddha Roy |
Contact Center Scheduling with Strict Resource Requirements. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Bonami |
Lift-and-Project Cuts for Mixed Integer Convex Programs. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Claudia D'Ambrosio, Jeff Linderoth, James Luedtke |
Valid Inequalities for the Pooling Problem with Binary Variables. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Bergner, Alberto Caprara, Fabio Furini, Marco E. Lübbecke, Enrico Malaguti, Emiliano Traversi |
Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Thomas McCormick, Britta Peis |
A Primal-Dual Algorithm for Weighted Abstract Cut Packing. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Matteo Fischetti, Michele Monaci |
Backdoor Branching. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ojas Parekh |
Iterative Packing for Demand and Hypergraph Matching. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander A. Ageev, Yohann Benchetrit, András Sebö, Zoltán Szigeti |
An Excluded Minor Characterization of Seymour Graphs. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio |
A New Approach to the Stable Set Problem Based on Ellipsoids. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Santanu S. Dey, Sebastian Pokutta |
Design and Verify: A New Scheme for Generating Cutting-Planes. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yu-Hin Au, Levent Tunçel |
Complexity Analyses of Bienstock-Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna R. Karlin, Claire Mathieu, C. Thach Nguyen |
Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack. |
IPCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | René Sitters |
Efficient Algorithms for Average Completion Time Scheduling. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kent Andersen, Robert Weismantel |
Zero-Coefficient Cuts. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan |
On k-Column Sparse Packing Programs. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Santanu S. Dey, Juan Pablo Vielma |
The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino |
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Raymond Hemmecke, Matthias Köppe, Robert Weismantel |
A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov |
Prize-Collecting Steiner Network Problems. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Eisenbrand, F. Bruce Shepherd (eds.) |
Integer Programming and Combinatorial Optimization, 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Steve Tyber, Ellis L. Johnson |
A Polyhedral Study of the Mixed Integer Cut. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis |
On Generalizations of Network Design Problems with Degree Bounds. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie |
Universal Sequencing on a Single Machine. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Bley, Jose Neto |
Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Santanu S. Dey, Andrea Lodi, Andrea Tramontani, Laurence A. Wolsey |
Experiments with Two Row Tableau Cuts. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli |
On Lifting Integer Variables in Minimal Inequalities. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Bienstock, Mark Zuckerberg |
Solving LP Relaxations of Large-Scale Precedence Constrained Problems. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Jochen Könemann, David Pritchard |
Hypergraphic LP Relaxations for Steiner Trees. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam N. Letchford |
Integer Quadratic Quasi-polyhedra. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristóf Bérczi, László A. Végh |
Restricted b-Matchings in Degree-Bounded Graphs. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ankit Aggarwal, L. Anand, Manisha Bansal, Naveen Garg, Neelima Gupta, Shubham Gupta, Surabhi Jain |
A 3-Approximation for Facility Location with Uniform Capacities. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | James Luedtke |
An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy |
Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi |
Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis |
Symmetry Matters for the Sizes of Extended Formulations. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Siavosh Benabbas, Avner Magen |
Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Buchheim, Alberto Caprara, Andrea Lodi |
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann |
On Column-Restricted and Priority Covering Integer Programs. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Pokutta, Andreas S. Schulz |
On the Rank of Cutting-Plane Proof Systems. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Roberto Solis-Oba |
An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Umang Bhaskar, Lisa Fleischer, Chien-Chung Huang |
The Price of Collusion in Series-Parallel Networks. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel Fiorini, Gwenaël Joret, Ugo Pietropaoli |
Hitting Diamonds and Growing Cacti. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Takuro Fukunaga |
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Bienstock |
Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")