researchr
explore
Tags
Journals
Conferences
Authors
Profiles
Groups
calendar
New Conferences
Events
Deadlines
search
search
You are not signed in
Sign in
Sign up
Links
Filter by Year
[-]
OR
AND
NOT
1
1990
1992
1993
1995
1996
1998
1999
2001
2002
2004
2005
2007
2008
2010
2011
2013
2014
2016
2017
2019
2020
2021
2022
2023
2024
2025
Filter by Tag
[+]
OR
AND
NOT
1
C++
Epsilon
Markov
analysis
constraints
data-flow
design
e-science
graph-rewriting
open-source
optimization
planar graph
program optimization
programming
rewriting
routing
rule-based
source-to-source
systematic-approach
testing
Filter by Author
[+]
OR
AND
NOT
1
Alberto Del Pia
Amitabh Basu
Andrea Lodi
Andreas S. Schulz
Andreas Wiese
András Sebö
Anupam Gupta
Bertrand Guenin
David B. Shmoys
David P. Williamson
Gerhard J. Woeginger
Gérard Cornuéjols
Joseph Paat
Matteo Fischetti
Maurice Queyranne
Maxim Sviridenko
Michele Conforti
Robert Weismantel
Santanu S. Dey
Viswanath Nagarajan
Filter by Top terms
[+]
OR
AND
NOT
1
algorithm
algorithms
approximation
bounds
combinatorial
cut
cuts
flow
graphs
integer
linear
mixed
optimization
polynomial
problem
problems
programming
programs
scheduling
time
IPCO (ipco)
Editions
Publications
Viewing Publication 1 - 100 from 900
2025
Strongly Connected Orientations and Integer Lattices
Ahmad Abdi
,
Gérard Cornuéjols
,
Siyue Liu
,
Olha Silina
.
ipco 2025
:
1-14
[doi]
Prize-Collecting Forest with Submodular Penalties: Improved Approximation
Ali Ahmadi
,
Iman Gholami
,
MohammadTaghi Hajiaghayi
,
Peyman Jabbarzade
,
Mohammad Mahdavi
.
ipco 2025
:
15-28
[doi]
Integer and Unsplittable Multiflows in Series-Parallel Digraphs
Mohammed Majthoub Almoghrabi
,
Martin Skutella
,
Philipp Warode
.
ipco 2025
:
427-441
[doi]
On the Approximability of Unsplittable Flow on a Path with Time Windows
Alexander Armbruster
,
Fabrizio Grandoni 0001
,
Edin Husic
,
Antoine Tinguely
,
Andreas Wiese
.
ipco 2025
:
29-42
[doi]
A Constant-Factor Approximation for Pairwise Fair k-Center Clustering
Sayan Bandyapadhyay
,
Tianzhi Chen
,
Zachary Friggstad
,
Mahya Jamshidian
.
ipco 2025
:
43-57
[doi]
A Global Analysis of the Primal-Dual Method for Edge Augmentation Problems
Ishan Bansal
.
ipco 2025
:
58-71
[doi]
Monotone Submodular Multiway Partition
Richard Bi
,
Karthekeyan Chandrasekaran
,
Soham Joshi
.
ipco 2025
:
72-85
[doi]
Exponential Lower Bounds for Many Pivot Rules for the Simplex Method
Alexander E. Black
.
ipco 2025
:
86-99
[doi]
Online Matching on 3-Uniform Hypergraphs
Sander Borst
,
Danish Kashaev
,
Zhuan Khye Koh
.
ipco 2025
:
100-113
[doi]
On the Bidirected Cut Relaxation for Steiner Forest
Jaroslaw Byrka
,
Fabrizio Grandoni 0001
,
Vera Traub
.
ipco 2025
:
114-127
[doi]
Matroid Secretary via Labeling Schemes
Kristóf Bérczi
,
Vasilis Livanos
,
José A. Soto
,
Victor Verdugo
.
ipco 2025
:
128-141
[doi]
Valid Cuts for the Design of Potential-Based Flow Networks
Pascal Börner
,
Max Klimm
,
Annette Lutz
,
Marc E. Pfetsch
,
Martin Skutella
,
Lea Strubberg
.
ipco 2025
:
142-156
[doi]
The Differentiable Feasibility Pump
Matteo Cacciola
,
Alexandre Forel
,
Antonio Frangioni
,
Andrea Lodi 0001
.
ipco 2025
:
157-171
[doi]
Approximate Cut & Packing Ratios for Multi-commodity Arborescences
Parinya Chalermsook
,
Chien-Chung Huang
.
ipco 2025
:
172-183
[doi]
Lagrangian Dual for Integer Optimization with Zero Duality Gap that Admits Decomposition
Diego Cifuentes
,
Santanu S. Dey
,
Jingye Xu
.
ipco 2025
:
184-198
[doi]
Reducing the Large Set Threshold for Oertel's Conjecture on the Mixed-Integer Volume
Andrés Cristi
,
David Salas
.
ipco 2025
:
199-212
[doi]
An Unconditional Lower Bound for the Active-Set Method on the Hypercube
Yann Disser
,
Nils Mosis
.
ipco 2025
:
213-227
[doi]
Non-distributive Lattices, Stable Matchings, and Linear Optimization
Christopher En
,
Yuri Faenza
.
ipco 2025
:
228-241
[doi]
Unsplittable Multicommodity Flows in Outerplanar Graphs
David Alemán Espinosa
,
Nikhil Kumar
.
ipco 2025
:
385-399
[doi]
Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
Yuval Filmus
,
Roy Schwartz 0002
,
Alexander V. Smal
.
ipco 2025
:
242-255
[doi]
Completeness in the Polynomial Hierarchy for Many Natural Problems in Bilevel and Robust Optimization
Christoph Grüne
,
Lasse Wulf
.
ipco 2025
:
256-269
[doi]
Semirandom Planted Clique via 1-Norm Isometry Property
Venkatesan Guruswami
,
Hsin-Po Wang 0001
.
ipco 2025
:
270-282
[doi]
Sequential Testing with Subadditive Costs
Blake Harris
,
Viswanath Nagarajan
,
Rayen Tan
.
ipco 2025
:
283-296
[doi]
(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
Christoph Hunkenschröder
,
Martin Koutecký
,
Asaf Levin
,
Tung Anh Vu
.
ipco 2025
:
297-311
[doi]
An O(log n)-Approximation Algorithm for (p, q)-Flexible Graph Connectivity via Independent Rounding
Sharat Ibrahimpur
,
László A. Végh
.
ipco 2025
:
312-325
[doi]
A Black-Box Approach for Exogenous Replenishment in Online Resource Allocation
Suho Kang
,
Ziyang Liu
,
Rajan Udwani
.
ipco 2025
:
326-340
[doi]
Generalized Assignment and Knapsack Problems in the Random-Order Model
Max Klimm
,
Martin Knaack
.
ipco 2025
:
341-354
[doi]
Totally $\varDelta $-Modular IPs with Two Non-zeros in Most Rows
Stefan Kober
.
ipco 2025
:
355-370
[doi]
Sparse Approximation in Lattices and Semigroups
Stefan Kuhlmann
,
Timm Oertel
,
Robert Weismantel
.
ipco 2025
:
371-384
[doi]
The Augmented Factorization Bound for Maximum-Entropy Sampling
Yongchun Li
.
ipco 2025
:
412-426
[doi]
A Simple and Fast Algorithm for Fair Cuts
Jason Li
,
Owen Li
.
ipco 2025
:
400-411
[doi]
Integer Programming and Combinatorial Optimization - 26th International Conference, IPCO 2025, Baltimore, MD, USA, June 11-13, 2025, Proceedings
Nicole Megow
,
Amitabh Basu
, editors,
Volume 15620 of
Lecture Notes in Computer Science
, Springer,
2025.
[doi]
Space-Efficient Algorithm for Integer Programming with Few Constraints
Lars Rohwedder
,
Karol Wegrzycki
.
ipco 2025
:
442-451
[doi]
Implied Integrality in Mixed-Integer Optimization
Rolf van der Hulst
,
Matthias Walter
.
ipco 2025
:
452-465
[doi]
2024
Separating k -sc Median from the Supplier Version
Aditya Anand 0001
,
Euiwoong Lee
.
ipco 2024
:
14-27
[doi]
Pairwise-Independent Contention Resolution
Anupam Gupta 0001
,
Jinqiao Hu
,
Gregory Kehne
,
Roie Levin
.
ipco 2024
:
196-209
[doi]
A First Order Method for Linear Programming Parameterized by Circuit Imbalance
Richard Cole 0001
,
Christoph Hertrich
,
Yixin Tao
,
László A. Végh
.
ipco 2024
:
57-70
[doi]
Sparsity and Integrality Gap Transference Bounds for Integer Programs
Iskander Aliev
,
Marcel Celaya
,
Martin Henk
.
ipco 2024
:
1-13
[doi]
Assortment Optimization with Visibility Constraints
Théo Barré
,
Omar El Housni
,
Andrea Lodi 0001
.
ipco 2024
:
124-138
[doi]
A Better-Than-1.6-Approximation for Prize-Collecting TSP
Jannis Blauth
,
Nathan Klein
,
Martin Nägele
.
ipco 2024
:
28-42
[doi]
On Matrices over a Polynomial Ring with Restricted Subdeterminants
Marcel Celaya
,
Stefan Kuhlmann
,
Robert Weismantel
.
ipco 2024
:
43-56
[doi]
Sensitivity Analysis for Mixed Binary Quadratic Programming
Diego Cifuentes
,
Santanu S. Dey
,
Jingye Xu
.
ipco 2024
:
446-459
[doi]
Approximately Packing Dijoins via Nowhere-Zero Flows
Gérard Cornuéjols
,
Siyue Liu
,
R. Ravi 0001
.
ipco 2024
:
71-84
[doi]
Capacitated Facility Location with Outliers and Uniform Facility Costs
Rajni Dabas
,
Naveen Garg 0001
,
Neelima Gupta
.
ipco 2024
:
85-98
[doi]
The Extension Complexity of Polytopes with Bounded Integral Slack Matrices
Sally Dong
,
Thomas Rothvoss
.
ipco 2024
:
113-123
[doi]
Fast Combinatorial Algorithms for Efficient Sortation
Madison Van Dyk
,
Kim Klause
,
Jochen Könemann
,
Nicole Megow
.
ipco 2024
:
418-432
[doi]
Two-Stage Stochastic Stable Matching
Yuri Faenza
,
Ayoub Foussoul
,
Chengyue He
.
ipco 2024
:
154-167
[doi]
Von Neumann-Morgenstern Stability and Internal Closedness in Matching Theory
Yuri Faenza
,
Cliff Stein 0001
,
Jia Wan 0002
.
ipco 2024
:
168-181
[doi]
Fully-Dynamic Load Balancing
Ayoub Foussoul
,
Vineet Goyal
,
Amit Kumar
.
ipco 2024
:
182-195
[doi]
Adaptivity Gaps in Two-Sided Assortment Optimization
Omar El Housni
,
Alfredo Torrico
,
Ulysse Hennebelle
.
ipco 2024
:
139-153
[doi]
An FPTAS for Connectivity Interdiction
Chien-Chung Huang
,
Nidia Obscura Acosta
,
Sorrachai Yingchareonthawornchai
.
ipco 2024
:
210-223
[doi]
Tight Lower Bounds for Block-Structured Integer Programs
Christoph Hunkenschröder
,
Kim-Manuel Klein
,
Martin Koutecký
,
Alexandra Lassota
,
Asaf Levin
.
ipco 2024
:
224-237
[doi]
A Lower Bound for the Max Entropy Algorithm for TSP
Billy Jin
,
Nathan Klein
,
David P. Williamson
.
ipco 2024
:
238-251
[doi]
On the Number of Degenerate Simplex Pivots
Kirill Kukharenko
,
Laura Sanità
.
ipco 2024
:
252-264
[doi]
On the Partial Convexification of the Low-Rank Spectral Optimization: Rank Bounds and Algorithms
Yongchun Li
,
Weijun Xie 0001
.
ipco 2024
:
265-279
[doi]
On the Congruency-Constrained Matroid Base
Siyue Liu
,
Chao Xu 0002
.
ipco 2024
:
280-293
[doi]
Integer Points in Arbitrary Convex Cones: The Case of the PSD and SOC Cones
Jesús A. De Loera
,
Brittney Marsters
,
Luze Xu
,
Shixuan Zhang
.
ipco 2024
:
99-112
[doi]
Online Combinatorial Assignment in Independence Systems
Javier Marinkovic
,
José A. Soto
,
Victor Verdugo
.
ipco 2024
:
294-308
[doi]
Decomposing Probability Marginals Beyond Affine Requirements
Jannik Matuschke
.
ipco 2024
:
309-322
[doi]
Polynomial Algorithms to Minimize 2/3-Submodular Functions
Ryuhei Mizutani
,
Yuki Yoshida
.
ipco 2024
:
323-336
[doi]
A $\nicefrac {4}{3}$-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs
Meike Neuwohner
.
ipco 2024
:
337-350
[doi]
Extending the Primal-Dual 2-Approximation Algorithm Beyond Uncrossable Set Families
Zeev Nutov
.
ipco 2024
:
351-364
[doi]
Network Flow Problems with Electric Vehicles
Haripriya Pulyassary
,
Kostas Kollias
,
Aaron Schild
,
David B. Shmoys
,
Manxi Wu
.
ipco 2024
:
365-378
[doi]
Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack
Jamico Schade
,
Makrand Sinha
,
Stefan Weltge
.
ipco 2024
:
379-392
[doi]
Relaxation Strength for Multilinear Optimization: McCormick Strikes Back
Emily Schutte
,
Matthias Walter
.
ipco 2024
:
393-404
[doi]
Online Algorithms for Spectral Hypergraph Sparsification
Tasuku Soma
,
Kam Chuen Tung
,
Yuichi Yoshida
.
ipco 2024
:
405-417
[doi]
A New Branching Rule for Range Minimization Problems
Bart van Rossum
,
Rui Chen
,
Andrea Lodi 0001
.
ipco 2024
:
433-445
[doi]
Integer Programming and Combinatorial Optimization - 25th International Conference, IPCO 2024, Wrocław, Poland, July 3-5, 2024, Proceedings
Jens Vygen
,
Jaroslaw Byrka
, editors,
Volume 14679 of
Lecture Notes in Computer Science
, Springer,
2024.
[doi]
2023
Competitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling
Sven Jäger 0001
,
Guillaume Sagnol
,
Daniel Schmidt genannt Waldschmidt
,
Philipp Warode
.
ipco 2023
:
246-260
[doi]
Optimal General Factor Problem and Jump System Intersection
Yusuke Kobayashi 0001
.
ipco 2023
:
291-305
[doi]
Information Complexity of Mixed-Integer Convex Optimization
Amitabh Basu
,
Hongyi Jiang
,
Phillip A. Kerger
,
Marco Molinaro 0001
.
ipco 2023
:
1-13
[doi]
Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products
Ksenia Bestuzheva
,
Ambros M. Gleixner
,
Tobias Achterberg
.
ipco 2023
:
14-28
[doi]
A Nearly Optimal Randomized Algorithm for Explorable Heap Selection
Sander Borst
,
Daniel Dadush
,
Sophie Huiberts
,
Danish Kashaev
.
ipco 2023
:
29-43
[doi]
Sparse Approximation over the Cube
Sabrina Bruckmeier
,
Christoph Hunkenschröder
,
Robert Weismantel
.
ipco 2023
:
44-57
[doi]
Recycling Inequalities for Robust Combinatorial Optimization with Budget Uncertainty
Christina Büsing
,
Timo Gersing
,
Arie M. C. A. Koster
.
ipco 2023
:
58-71
[doi]
Inapproximability of Shortest Paths on Perfect Matching Polytopes
Jean Cardinal
,
Raphael Steiner
.
ipco 2023
:
72-86
[doi]
Monoidal Strengthening and Unique Lifting in MIQCPs
Antonia Chmiela
,
Gonzalo Muñoz
,
Felipe Serrano
.
ipco 2023
:
87-99
[doi]
Optimizing Low Dimensional Functions over the Integers
Daniel Dadush
,
Arthur Léonard
,
Lars Rohwedder
,
José Verschae
.
ipco 2023
:
115-126
[doi]
From Approximate to Exact Integer Programming
Daniel Dadush
,
Friedrich Eisenbrand
,
Thomas Rothvoss
.
ipco 2023
:
100-114
[doi]
Configuration Balancing for Stochastic Requests
Franziska Eberle
,
Anupam Gupta 0001
,
Nicole Megow
,
Benjamin Moseley
,
Rudy Zhou
.
ipco 2023
:
127-141
[doi]
An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem
Satoru Fujishige
,
Tomonari Kitahara
,
László A. Végh
.
ipco 2023
:
142-156
[doi]
Stabilization of Capacitated Matching Games
Matthew Gerstbrein
,
Laura Sanità
,
Lucy Verberk
.
ipco 2023
:
157-171
[doi]
Designing Optimization Problems with Diverse Solutions
Oussama Hanguir
,
Will Ma
,
Christopher Thomas Ryan
.
ipco 2023
:
172-186
[doi]
ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation
Christoph Hertrich
,
Leon Sering
.
ipco 2023
:
187-202
[doi]
A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP
Billy Jin
,
Nathan Klein
,
David P. Williamson
.
ipco 2023
:
217-230
[doi]
The Polyhedral Geometry of Truthful Auctions
Michael Joswig
,
Max Klimm
,
Sylvain Spitz
.
ipco 2023
:
231-245
[doi]
A Deterministic Better-than-3/2 Approximation Algorithm for Metric TSP
Anna R. Karlin
,
Nathan Klein
,
Shayan Oveis Gharan
.
ipco 2023
:
261-274
[doi]
V-Polyhedral Disjunctive Cuts
Aleksandr M. Kazachkov
,
Egon Balas
.
ipco 2023
:
275-290
[doi]
Decomposition of Probability Marginals for Security Games in Abstract Networks
Jannik Matuschke
.
ipco 2023
:
306-318
[doi]
Set Selection Under Explorable Stochastic Uncertainty via Covering Techniques
Nicole Megow
,
Jens Schlöter
.
ipco 2023
:
319-333
[doi]
Exploiting the Polyhedral Geometry of Stochastic Linear Bilevel Programming
Gonzalo Muñoz
,
David Salas
,
Anton Svensson
.
ipco 2023
:
363-377
[doi]
Compressing Branch-and-Bound Trees
Gonzalo Muñoz
,
Joseph Paat
,
Álinson S. Xavier
.
ipco 2023
:
348-362
[doi]
Towards a Characterization of Maximal Quadratic-Free Sets
Gonzalo Muñoz
,
Joseph Paat
,
Felipe Serrano
.
ipco 2023
:
334-347
[doi]
Towards an Optimal Contention Resolution Scheme for Matchings
Pranav Nuti
,
Jan Vondrák
.
ipco 2023
:
378-392
[doi]
Advances on Strictly $\varDelta $-Modular IPs
Martin Nägele
,
Christian Nöbel
,
Richard Santiago
,
Rico Zenklusen
.
ipco 2023
:
393-407
[doi]
Integer Programming and Combinatorial Optimization - 24th International Conference, IPCO 2023, Madison, WI, USA, June 21-23, 2023, Proceedings
Alberto Del Pia
,
Volker Kaibel
, editors,
Volume 13904 of
Lecture Notes in Computer Science
, Springer,
2023.
[doi]
Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid
Richard Santiago
,
Ivan Sergeev
,
Rico Zenklusen
.
ipco 2023
:
423-437
[doi]
A Fast Combinatorial Algorithm for the Bilevel Knapsack Problem with Interdiction Constraints
Noah Weninger
,
Ricardo Fukasawa
.
ipco 2023
:
438-452
[doi]
Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching
Da-Wei Zheng
,
Monika Henzinger
.
ipco 2023
:
453-465
[doi]
A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems
Eranda Çela
,
Bettina Klinz
,
Stefan Lendl
,
Gerhard J. Woeginger
,
Lasse Wulf
.
ipco 2023
:
466-479
[doi]
Sign in
or
sign up
to see more results.