yusuke1997/dblp-id-title huggingface dataset:
Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring
A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
Unique Sink Orientations of Grids
A Deterministic Better-than-3/2 Approximation Algorithm for Metric TSP
Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs
Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths
Min-Max Theorems for Packing and Covering Odd (u, v)-trails
Approximation of Corner Polyhedra with Families of Intersection Cuts
Lifting Convex Inequalities for Bipartite Bilinear Programs
Excluded t-Factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-Matchings
Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point
Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual
A Mickey-Mouse Decomposition Theorem
Identically Self-blocking Clutters
On Matrices over a Polynomial Ring with Restricted Subdeterminants
Contact Center Scheduling with Strict Resource Requirements
Linear Regression with Mismatched Data: A Provably Optimal Local Search Algorithm
Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem: Extended Abstract
Intersection Cuts for Factorable MINLP
Optimizing over Semimetric Polytopes
Polynomial Algorithms to Minimize 2/3-Submodular Functions
An Improved Algorithm for Finding Cycles Through Elements
On k -Column Sparse Packing Programs
Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem
A General Framework for Handling Commitment in Online Throughput Maximization
Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs
Circuit packings on surfaces with at most three cross-caps
The Price of Collusion in Series-Parallel Networks
Approximate $\mathrm {CVP}_{}$ in Time 2 0.802 n - Now in Any Norm!
A Simple and Fast Algorithm for Fair Cuts
Use of Hidden Network Structure in the Set Partitioning Problem
Parity Constrained k -Edge-Connected Orientations
Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
A Combinatorial Algorithm to Find a Maximum Even Factor
Algorithms for Minimizing Response Time in Broadcast Scheduling
Prize-Collecting Forest with Submodular Penalties: Improved Approximation
On the Implementation and Strengthening of Intersection Cuts for QCQPs
Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge
An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems
Monoidal Strengthening and Unique Lifting in MIQCPs
Min Sum Edge Coloring in Multigraphs Via Configuration LP
Recycling Inequalities for Robust Combinatorial Optimization with Budget Uncertainty
A primal-dual parallel approximation technique applied to weighted set and vertex cover
The Minimum Latency Problem Is NP-Hard for Weighted Trees
An Improved Integrality Gap for the Călinescu-Karloff-Rabani Relaxation for Multiway Cut
Flow in Planar Graphs with Vertex Capacities
Approximate Multi-matroid Intersection via Iterative Refinement
On Simplex Pivoting Rules and Complexity Theory
On Identifying in Polynomial Time Violated Subtour Elimination and Precedence Forcing Constraints for the Sequential Ordering Problem
An efficient implementation of a scaling minimum-cost flow algorithm
Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets
Cycles of prescribed modularity in planar digraphs
Cone-LP's and Semidefinite Programs: Geometry
The Interval Order Polytope of a Digraph
A First Order Method for Linear Programming Parameterized by Circuit Imbalance
Combinatorial Optimization with Semi-Definite Matrices
Towards a Characterization of Maximal Quadratic-Free Sets
Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines
Improved Approximation Algorithms for Capacitated Facility Location Problems
A Constant-Factor Approximation for Pairwise Fair k-Center Clustering
Mixed-Integer Linear Representability, Disjunctions, and Variable Elimination
The Markovian Price of Information
Design and Verify: A New Scheme for Generating Cutting-Planes
Separating Clique Tree and Bipartition Inequalities in Polynominal Time
Consecutive Ones and a Betweenness Problem in Computational Biology
Online Matroid Intersection: Beating Half for Random Arrival
Iterative Packing for Demand and Hypergraph Matching
A Criterion of Polynomial-Time Solvability for the Network Location Problem
A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts
An Abstract Model for Branch-and-Cut
A PTAS for the Horizontal Rectangle Stabbing Problem
Delta-polymatroids and an extension of Edmonds-Giles' TDI scheme
Improved Approximation Algorithms for Uncapitated Facility Location
Sequential-Merge Facets for Two-Dimensional Group Problems
An Optimal, Stable Continued Fraction Algorithm
Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems
A Generic Exact Solver for Vehicle Routing and Related Problems
Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem
A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems
On Multiflow Problems
Characterizing Noninteger Polyhedra with 0-1 Constraints
Capacitated Vehicle Routing with Non-uniform Speeds
On Some Polytopes Contained in the 0, 1 Hypercube that Have a Small Chvátal Rank
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
Simple Generalized Maximum Flow Algorithms
Metric Inequalities and the Network Loading Problem
Single Source Unsplittable Flows with Arc-Wise Lower and Upper Bounds
The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs
Nearly uniform scheduling of file transfers
Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities
Matching Problems in Polymatroids Without Double Circuits
Two-Stage Stochastic Stable Matching
Colourful Linear Programming
Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
Intersection Cuts for Bilevel Optimization
Building Edge-Failure Resilient Networks
A Generalization of Edmonds' Matching and Matroid Intersection Algorithms
Network Design with Divisible Capacities: Aggregated Flow and Knapsack Subproblems
A epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems
Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
Fixed-Order Scheduling on Parallel Machines
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
Stability Critical Graphs and Even Subdivisions of K_4
A Better-Than-1.6-Approximation for Prize-Collecting TSP
High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy and CG Cuts
The Augmented Factorization Bound for Maximum-Entropy Sampling
Integer Programming and Combinatorial Optimization - 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings
Simple Extensions of Polytopes
A Polynomial Time Approximation Scheme for the Square Packing Problem
A Primal-Dual Algorithm for Weighted Abstract Cut Packing
Approximating the Discrete Time-Cost Tradeoff Problem with Bounded Depth
On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming
The Structure of the Infinite Models in Integer Programming
Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time
Valid Inequalities for Separable Concave Constraints with Indicator Variables
On Some Generalizations of the Split Closure
Polyhedral Combinatorics of Quadratic Assignment Problems with Less Objects than Locations
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
A Quasi-Polynomial Approximation for the Restricted Assignment Problem
Tight Approximation Ratio for Minimum Maximal Matching
Optimal Efficiency Guarantees for Network Design Mechanisms
On the Structure of Reduced Kernel Lattice Bases
Rescaled Coordinate Descent Methods for Linear Programming
Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables
\ell _1 -sparsity Approximation Bounds for Packing Integer Programs
Max-Cut Under Graph Constraints
Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs
Simple Explicit Formula for Counting Lattice Points of Polyhedra
Max-Balanced Flows
Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm
The Travelling Salesman and the PQ-Tree
Improving the Approximation Ratio for Capacitated Vehicle Routing
Cut Generation through Binarization
Dynamic Flows with Adaptive Route Choice
Can Pure Cutting Plane Algorithms Work?
On Convex Minimization over Base Polytopes
ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation
Independence Free Graphs and Vertex Connectivity Augmentation
A Decomposition Theorem for Balanced Matrices
Sequence Independent Lifting of Cover Inequalities
On the Adaptivity Gap of Stochastic Orienteering
A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity
Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain
Semi-continuous Cuts for Mixed-Integer Programming
Local Guarantees in Graph Cuts and Clustering
Bounds for Deterministic Periodic Routing Sequences
A Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle Covering
On the Clique-Rank and the Coloration of Perfect Graphs
The Fastest Algorithm for the Pert Problem with AND-and OR-Nodes (The New-Product-New-Technology Problem)
Embedding Graphs in the Torus in Linear Time
On Compact Representations of Voronoi Cells of Lattices
Adaptivity Gaps in Two-Sided Assortment Optimization
A $\frac{5}{4}$ -Approximation for Subcubic 2EC Using Circulations
A New Bound for the 2-Edge Connected Subgraph Problem
Integer Programming and Combinatorial Optimization - 26th International Conference, IPCO 2025, Baltimore, MD, USA, June 11-13, 2025, Proceedings
Bidimensional Packing by Bilinear Programming
Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation
Two Dimensional Optimal Mechanism Design for a Sequencing Problem
An Interior-Point Approach to NP-Complete Problems
How to Make a Strongly Connected Digraph Two-Connected
On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem
Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times
Earliest Arrival Transshipments in Networks with Multiple Sinks
The Metric Polytope
A New Min-Cut Max-Flow Ratio for Multicommodity Flows
Coloring Bipartite Hypergraphs
The Topological Structure of Maximal Lattice Free Convex Bodies: The General Case
The Euclidean k-Supplier Problem
Lift-and-Project Cuts for Mixed Integer Convex Programs
Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack
Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings
Sequential Pairing of Mixed Integer Inequalities
The Semidefinite Relaxation of the k -Partition Polytope Is Strong
Blocking Optimal Arborescences
The m-Cost ATSP
Distinct Triangle Areas in a Planar Point Set
The Intersection of Knapsack Polyhedra and Extensions
An Improved Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties
Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings
Lagrangian Dual for Integer Optimization with Zero Duality Gap that Admits Decomposition
The Air Traffic Flow Management Problem: An Integer Optimization Approach
Submodular Unsplittable Flow on Trees
Primal-Dual Schema for Capacitated Covering Problems
On Convex Hulls of Epigraphs of QCQPs
Nasty TSP Instances for Farthest Insertion
A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem
Assortment Optimization with Visibility Constraints
On the monotonization of polyhedra
TSP on Cubic and Subcubic Graphs
Integer Programming and Combinatorial Optimization - 24th International Conference, IPCO 2023, Madison, WI, USA, June 21-23, 2023, Proceedings
The Quadratic Assignment Problem with a Monotone Anti-Monge and a Symmetric Toeplitz Matrix: Easy and Hard Cases
A Characterization of Weakly Bipartite Graphs
Integrality Gaps of Integer Knapsack Problems
Persistency of Linear Programming Relaxations for the Stable Set Problem
Matroid Secretary via Labeling Schemes
A Faster Exact Separation Algorithm for Blossom Inequalities
Advances on Strictly $\varDelta $-Modular IPs
A Faster Scaling Algorithm for Minimizing Submodular Functions
An Improved Deterministic Rescaling for Linear Programming Algorithms
On the Unique-Lifting Property
Breaking Symmetries to Rescue Sum of Squares: The Case of Makespan Scheduling
A Min-Max Theorem on Feedback Vertex Sets
The Stable Roommates Problem with Choice Functions
The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron
Approximation Algorithms for a Directed Network Design Problem
Power Optimization for Connectivity Problems
On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables
Approximation Algorithms for 2-Stage Stochastic Scheduling Problems
Using path inequalities in a branch and cut code for the symmetric traveling salesman problem
Round-Robin Tournaments Generated by the Circle Method Have Maximum Carry-Over
Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time
A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems
Distributed Near-Optimal Matching
On Scheduling Coflows - (Extended Abstract)
Bisubmodular Function Minimization
Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts
An Exact Algorithm for Robust Influence Maximization
Restricted b -Matchings in Degree-Bounded Graphs
Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming
A Fast, Simpler Algorithm for the Matroid Parity Problem
Improved Approximation Algorithms for Inventory Problems
More on a Binary-Encoded Coloring Formulation
Space-Efficient Algorithm for Integer Programming with Few Constraints
Approximating k-Spanner Problems for k>2
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29 - May 1, 1993
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings
Polyhedral Combinatorics of Benzenoid Problems
How Good Are Sparse Cutting-Planes?
Better s-t-Tours by Gao Trees
On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems
Cuts for Conic Mixed-Integer Programming
Primal-Dual Approximation Algorithms for Feedback Problems
The Maximum Traveling Salesman Problem Under Polyhedral Norms
On the Notions of Facets, Weak Facets, and Extreme Functions of the Gomory-Johnson Infinite Group Problem
Branched Polyhedral Systems
Submodular Maximization Meets Streaming: Matchings, Matroids, and More
A spectral approach to bandwidth and separator problems in graphs
An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem
Solving integer programs with Fenchel cutting planes and preprocessing
Extreme Functions with an Arbitrary Number of Slopes
Chain-Constrained Spanning Trees
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, USA, May 1992
Improved Approximation Algorithms for MAX k -CUT and MAX BISECTION
On Circuit Diameter Bounds via Circuit Imbalances
Universally Maximum Flow with Piecewise-Constant Capacities
The complex of maximal lattice free simplices
Integer Muticommodity Flow Problems
Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time
Improved Branch-Cut-and-Price for Capacitated Vehicle Routing
Fast Parallel Algorithms for Bipartite Matching
A $\nicefrac {4}{3}$-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs
On the Separation of Maximally Violated mod-k Cuts
Fixed-Charge Transportation on a Path: Linear Programming Formulations
A New Branching Rule for Range Minimization Problems
Sparse Multi-term Disjunctive Cuts for the Epigraph of a Function of Binary Variables
Complexity, Exactness, and Rationality in Polynomial Optimization
A Matroid Generalization of the Stable Matching Polytope
Budget Feasible Mechanisms on Matroids
A Computational Status Update for Exact Rational Mixed Integer Programming
k-Trails: Recognition, Complexity, and Approximations
Approximation-Friendly Discrepancy Rounding
Packing Under Convex Quadratic Constraints
Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract)
On the Radon Number of the Integer Lattice
Advances on Matroid Secretary Problems: Free Order Model and Laminar Case
Non-approximability Results for Scheduling Problems with Minsum Criteria
Jumping Doesn't Help in Abstract Cubes
Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width
Lattice-Free Simplices with Lattice Width 2d - o(d)
An Introduction to Empty Lattice Simplices
Coverings and Delta-Coverings
When cycles collapse: A general approximation technique for constrained two-connectivity problems
Von Neumann-Morgenstern Stability and Internal Closedness in Matching Theory
The Generalized Stable Set Problem for Claw-Free Bidirected Graphs
Optimal On-Line Algorithms for Single-Machine Scheduling
Finding Out Whether a Valid Inequality is Facet Defining
Efficient Algorithms for Average Completion Time Scheduling
Two O (log * k)-Approximation Algorithms for the Asymmetric k-Center Problem
The Cycling Property for the Clutter of Odd st-Walks
On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations
Constraint Orbital Branching
An analysis of a Monte Carlo algorithm for estimating the permanent
A New Approach to Splitting-Off
Polyhedra and Optimization in Connection with a Weak Majorization Ordering
A new \frac34-approximation algorithm for MAX SAT
Valid Inequalities for the Pooling Problem with Binary Variables
Separable Concave Optimization Approximately Equals Piecewise Linear Optimization
Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
Low-Dimensional Faces of Random 0/1-Polytopes
Generalized Max Flows and Augmenting Paths
Sequential Testing with Subadditive Costs
Integer Solution to Synthesis of Communication Networks
On the geodesic-structure of graphs: a polyhedral approach to metric decomposition
A New Subadditive Approach to Integer Programming
The K-Edge Connected Spanning Subgraph Polyhedron
Combinatorial Analysis of Generic Matrix Pencils
Robust k-Center with Two Types of Radii
Secretary Problems via Linear Programming
Adaptive Submodular Ranking
Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games
Mixed-Integer Convex Representability
Dynamic algorithms for optimization problems in bounded tree-width graphs
Towards an Optimal Contention Resolution Scheme for Matchings
Improved Randomized Approximation Algorithms for Lot-Sizing Problems
Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems
Continuous Relaxations for Constrained Maximum-Entropy Sampling
New Results on Facets of the Cut Cone
Approximate Cut & Packing Ratios for Multi-commodity Arborescences
Short Tours through Large Linear Forests
Three Kinds of Integer Programming Algorithms Based on Barvinok's Rational Functions
Computing the optimum stock size
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles
Not Every GTSP Facet Induces an STSP Facet
Offline and Online Facility Leasing
A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems
A Survey of Some Results in Discrete Optimisation
Polyhedral Description of Trees and Arborescences
Experiments with Two Row Tableau Cuts
Hypergraphic LP Relaxations for Steiner Trees
Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs
Minimum Cost Dynamic Flows: The Series-Parallel Case
(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
A Weighted Kt, t-Free t-Factor Algorithm for Bipartite Graphs
Extending the Primal-Dual 2-Approximation Algorithm Beyond Uncrossable Set Families
Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem
Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids
An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs
On the Integrality Gap of Binary Integer Programs with Gaussian Data
Separating over Classes of TSP Inequalities Defined by 0 Node-Lifting in Polynominal Time
Competitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling
The Square-Free 2-Factor Problem in Bipartite Graphs
A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem
Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, London, UK, June 8-10, 2020, Proceedings
Exploiting the Polyhedral Geometry of Stochastic Linear Bilevel Programming
The Complexity of Scheduling for p-Norms of Flow and Stretch - (Extended Abstract)
A Competitive Algorithm for Throughput Maximization on Identical Machines
On the (integral) maximum tw flow in vertex and edge capacitated planar graphs
Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs
Two-Term Disjunctions on the Second-Order Cone
Optimizing Sparsity over Lattices and Semigroups
Semirandom Planted Clique via 1-Norm Isometry Property
Integer Programming and Combinatorial Optimization - 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings
Random Walks, Totally Unimodular Matrices and a Randomised Dual Simplex Algorithm
Packing Interdiction and Partial Covering Problems
An O(log n)-Approximation Algorithm for (p, q)-Flexible Graph Connectivity via Independent Rounding
Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines with Nonstationary Speeds
On Lovász's cathedral theorem
LP-based Approximation Algorithms for Capacitated Facility Location
Generalized Assignment and Knapsack Problems in the Random-Order Model
On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem
Fair Colorful k-Center Clustering
The Markov Chain of Colourings
Mixed-Integer Column Generation Algorithms and the Probabilistic Maximum Satisfiability Problem
Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method
Speed-Robust Scheduling - Sand, Bricks, and Rocks
Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract)
Generating Multiple Solutions for Mixed Integer Programming Problems
A Subexponential Lower Bound for Zadeh's Pivoting Rule for Solving Linear Programs and Games
An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming
Importance Sampling via Load-Balanced Facility Location
Scheduling Multiple Variable-Speed Machines
A Theorem of Truemper
All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables
Decomposing Probability Marginals Beyond Affine Requirements
On the Complexity of Separation from the Knapsack Polytope
Lower Bounds and a New Exact Approach for the Bilevel Knapsack with Interdiction Constraints
The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs
Matroid and Knapsack Center Problems
On Dependent Randomized Rounding Algorithms
Stochastic Online Scheduling on Unrelated Machines
Non-distributive Lattices, Stable Matchings, and Linear Optimization
Mixed-Integer Vertex Covers on Bipartite Graphs