The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

URL (DBLP): http://dblp.uni-trier.de/db/conf/ipco

Publication years (Num. hits)
1990 (38) 1992 (34) 1993 (36) 1995 (37) 1996 (37) 1998 (33) 1999 (34) 2001 (33) 2002 (34) 2004 (33) 2005 (35) 2007 (37) 2008 (33) 2010 (35) 2011 (34) 2013 (34) 2014 (35) 2016 (34) 2017 (37) 2019 (34) 2020 (34) 2021 (34) 2022 (34) 2023 (34)
Publication types (Num. hits)
inproceedings(809) proceedings(24)
Venues (Conferences, Journals, ...)
IPCO(833)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 84 occurrences of 51 keywords

Results
Found 833 publication records. Showing 833 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Billy Jin, Nathan Klein, David P. Williamson A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Pranav Nuti, Jan Vondrák Towards an Optimal Contention Resolution Scheme for Matchings. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Antonia Chmiela, Gonzalo Muñoz, Felipe Serrano Monoidal Strengthening and Unique Lifting in MIQCPs. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Gonzalo Muñoz, Joseph Paat, Álinson S. Xavier Compressing Branch-and-Bound Trees. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Noah Weninger, Ricardo Fukasawa A Fast Combinatorial Algorithm for the Bilevel Knapsack Problem with Interdiction Constraints. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sabrina Bruckmeier, Christoph Hunkenschröder, Robert Weismantel Sparse Approximation over the Cube. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Da Wei Zheng, Monika Henzinger Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Christina Büsing, Timo Gersing, Arie M. C. A. Koster Recycling Inequalities for Robust Combinatorial Optimization with Budget Uncertainty. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Christoph Hertrich, Leon Sering ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Joseph Poremba, F. Bruce Shepherd Cut-Sufficient Directed 2-Commodity Multiflow Topologies. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Daniel Dadush, Arthur Léonard, Lars Rohwedder, José Verschae Optimizing Low Dimensional Functions over the Integers. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Franziska Eberle, Anupam Gupta 0001, Nicole Megow, Benjamin Moseley, Rudy Zhou Configuration Balancing for Stochastic Requests. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Jannik Matuschke Decomposition of Probability Marginals for Security Games in Abstract Networks. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan A Deterministic Better-than-3/2 Approximation Algorithm for Metric TSP. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Yusuke Kobayashi 0001 Optimal General Factor Problem and Jump System Intersection. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev A Nearly Optimal Randomized Algorithm for Explorable Heap Selection. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Ksenia Bestuzheva, Ambros M. Gleixner, Tobias Achterberg Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Jean Cardinal, Raphael Steiner Inapproximability of Shortest Paths on Perfect Matching Polytopes. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sven Jäger 0001, Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt, Philipp Warode Competitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Aleksandr M. Kazachkov, Egon Balas Monoidal Strengthening of Simple V-Polyhedral Disjunctive Cuts. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Richard Santiago, Ivan Sergeev, Rico Zenklusen Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Matthew Gerstbrein, Laura Sanità, Lucy Verberk Stabilization of Capacitated Matching Games. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Alberto Del Pia, Volker Kaibel (eds.) Integer Programming and Combinatorial Optimization - 24th International Conference, IPCO 2023, Madison, WI, USA, June 21-23, 2023, Proceedings Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Amitabh Basu, Hongyi Jiang, Phillip A. Kerger, Marco Molinaro 0001 Information Complexity of Mixed-Integer Convex Optimization. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Oussama Hanguir, Will Ma, Christopher Thomas Ryan Designing Optimization Problems with Diverse Solutions. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Satoru Fujishige, Tomonari Kitahara, László A. Végh An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss From Approximate to Exact Integer Programming. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Gonzalo Muñoz, David Salas, Anton Svensson Exploiting the Polyhedral Geometry of Stochastic Linear Bilevel Programming. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Nicole Megow, Jens Schlöter Set Selection Under Explorable Stochastic Uncertainty via Covering Techniques. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Michael Joswig, Max Klimm, Sylvain Spitz The Polyhedral Geometry of Truthful Auctions. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Martin Nägele, Christian Nöbel, Richard Santiago, Rico Zenklusen Advances on Strictly $\varDelta $-Modular IPs. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Edin Husic, Zhuan Khye Koh, Georg Loho, László A. Végh On the Correlation Gap of Matroids. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Gonzalo Muñoz, Joseph Paat, Felipe Serrano Towards a Characterization of Maximal Quadratic-Free Sets. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems. Search on Bibsonomy IPCO The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sammy Khalife, Amitabh Basu Neural Networks with Linear Threshold Activations: Structure and Algorithms. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu On the Complexity of Separation from the Knapsack Polytope. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Sina Dezfuli, Zachary Friggstad, Ian Post, Chaitanya Swamy Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Dimitris Fotakis 0001, Jannik Matuschke, Orestis Papadigenopoulos A Constant-Factor Approximation for Generalized Malleable Scheduling Under $M^\natural $-Concave Processing Speeds. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh On Circuit Diameter Bounds via Circuit Imbalances. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Eric Balkanski, Yuri Faenza, Mathieu Kubik The Simultaneous Semi-random Model for TSP. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1José Correa 0001, Andrés Cristi, Andrés Fielbaum, Tristan Pollner, S. Matthew Weinberg Optimal Item Pricing in Online Combinatorial Auctions. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Max Gläser, Marc E. Pfetsch On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Rohan Ghuge, Anupam Gupta 0001, Viswanath Nagarajan Non-adaptive Stochastic Score Classification and Explainable Halfspace Evaluation. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Lukas Mayrhofer, Jamico Schade, Stefan Weltge Lattice-Free Simplices with Lattice Width 2d - o(d). Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge A Simple Method for Convex Optimization in the Oracle Model. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Martin Drees Intersecting and Dense Restrictions of Clutters in Polynomial Time. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Meike Neuwohner The Limits of Local Search for Weighted k-Set Packing. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Benjamin Moseley, Kirk Pruhs, Clifford Stein 0001, Rudy Zhou A Competitive Algorithm for Throughput Maximization on Identical Machines. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Aleksandr M. Kazachkov, Pierre Le Bodic, Sriram Sankaranarayanan 0002 An Abstract Model for Branch-and-Cut. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Gennadiy Averkov, Matthias Schymura On the Maximal Number of Columns of a $\varDelta $-modular Matrix. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Marcel Celaya, Stefan Kuhlmann, Joseph Paat, Robert Weismantel Improving the Cook et al. Proximity Bound Given Integral Valued Constraints. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Arindam Khan 0001, Aditya Subramanian, Andreas Wiese A PTAS for the Horizontal Rectangle Stabbing Problem. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Thomas Rothvoss, Moritz Venzin Approximate $\mathrm {CVP}_{}$ in Time 20.802 n - Now in Any Norm! Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Pranav Nuti The Secretary Problem with Distributions. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Markus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Étienne Bamas, Marina Drygala, Ola Svensson A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Elisabeth Gaar, Jon Lee 0001, Ivana Ljubic, Markus Sinnl, Kübra Taninmis SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Samuel C. Gutekunst, Billy Jin, David P. Williamson The Two-Stripe Symmetric Circulant TSP is in P. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay, Mohammad R. Salavatipour Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Karen I. Aardal, Laura Sanità (eds.) Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay, Danupon Nanongkai Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Rui Chen, James R. Luedtke Sparse Multi-term Disjunctive Cuts for the Epigraph of a Function of Binary Variables. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Alberto Del Pia, Matthias Walter Simple Odd β-Cycle Inequalities for Binary Polynomial Optimization. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel Total Dual Dyadicness and Dyadic Generating Sets. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Anupam Gupta 0001, Euiwoong Lee, Jason Li 0006, Marcin Mucha, Heather Newman, Sherry Sarkar Matroid-Based TSP Rounding for Half-Integral Solutions. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Renee Mirka, Devin Smedira, David P. Williamson Graph Coloring and Semidefinite Rank. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Omar El Housni, Ayoub Foussoul, Vineet Goyal LP-Based Approximations for Disjoint Bilinear and Two-Stage Adjustable Robust Optimization. Search on Bibsonomy IPCO The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Antonia Chmiela, Gonzalo Muñoz, Felipe Serrano On the Implementation and Strengthening of Intersection Cuts for QCQPs. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Vinícius Loti de Lima, Manuel Iori, Flávio Keidi Miyazawa New Exact Techniques Applied to a Class of Network Flow Formulations. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon 0001 Speed-Robust Scheduling - Sand, Bricks, and Rocks. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Omar El Housni, Vineet Goyal, David B. Shmoys On the Power of Static Assignment Policies for Robust Facility Location Problems. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Karthekeyan Chandrasekaran, Weihang Wang 0002 Fixed Parameter Approximation Scheme for Min-Max k-Cut. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Christoph Glanzer, Ingo Stallknecht, Robert Weismantel On the Recognition of a, b, c-Modular Matrices. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Gennadiy Averkov, Christopher Hojny, Matthias Schymura Computational Aspects of Relaxation Complexity. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Siad Daboul, Stephan Held, Jens Vygen Approximating the Discrete Time-Cost Tradeoff Problem with Bounded Depth. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Deeparnab Chakrabarty, Maryam Negahbani Robust k-Center with Two Types of Radii. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Leon Eifler, Ambros M. Gleixner A Computational Status Update for Exact Rational Mixed Integer Programming. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1José Verschae, Matías Villagra, Léonard von Niederhäusern On the Geometry of Symmetry Breaking Inequalities. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Yuni Iwamasa A Combinatorial Algorithm for Computing the Degree of the Determinant of a Generic Partitioned Polynomial Matrix with $2\, \times \, 2$ Submatrices. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Lukas Graf 0001, Tobias Harks A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Marcel Celaya, Martin Henk Proximity Bounds for Random Integer Programs. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Kazuki Matoya, Taihei Oki Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Robert D. Carr, Neil Simonetti A New Integer Programming Formulation of the Graphical Traveling Salesman Problem. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Rahul Mazumder, Haoyue Wang Linear Regression with Mismatched Data: A Provably Optimal Local Search Algorithm. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Mohit Singh, David P. Williamson (eds.) Integer Programming and Combinatorial Optimization - 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19-21, 2021, Proceedings Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Xiaoyi Gu, Santanu S. Dey, Jean-Philippe P. Richard Lifting Convex Inequalities for Bipartite Bilinear Programs. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Giacomo Nannicini Fast Quantum Subroutines for the Simplex Method. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Daniel Bienstock, Alberto Del Pia, Robert Hildebrand Complexity, Exactness, and Rationality in Polynomial Optimization. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Lucas Slot, Monique Laurent Sum-of-Squares Hierarchies for Binary Polynomial Optimization. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Christian Coester, Joseph (Seffi) Naor Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Paritosh Garg, Linus Jordan, Ola Svensson Semi-streaming Algorithms for Submodular Matroid Intersection. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Daniel Rehfeldt, Thorsten Koch Implications, Conflicts, and Reductions for Steiner Trees. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari On the Integrality Gap of Binary Integer Programs with Gaussian Data. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Jannis Blauth, Vera Traub, Jens Vygen Improving the Approximation Ratio for Capacitated Vehicle Routing. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
1Matthias Walter Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs. Search on Bibsonomy IPCO The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 833 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license