Tightness of sensitivity and proximity bounds for integer linear programs
From MaRDI portal
Publication:831833
DOI10.1007/978-3-030-67731-2_25zbMath1492.90089arXiv2010.09255OpenAlexW3126375186MaRDI QIDQ831833
Klaus Jansen, Sebastian Berndt, Alexandra Lassota
Publication date: 24 March 2022
Full work available at URL: https://arxiv.org/abs/2010.09255
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factors and factorizations of graphs. Proof techniques in factor theory
- A robust APTAS for the classical bin packing problem
- Approximation schemes for scheduling on parallel machines
- Monotonizing linear programs with up to two nonzeroes per column
- Distances to lattice points in knapsack polyhedra
- Improving proximity bounds using sparsity
- Distances between optimal solutions of mixed-integer programs
- Friendly bin packing instances without integer round-up property
- Robust Approximation Schemes for Cube Packing
- Scheduling Jobs on Identical and Uniform Processors Revisited
- Online Scheduling with Bounded Migration
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures
- A Linear Programming Approach to the Cutting-Stock Problem
- Sensitivity theorems in integer linear programming
- On deciding the non‐emptiness of 2SAT polytopes with respect to First Order Queries
- Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
- Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding
- A Robust AFPTAS for Online Bin Packing with Polynomial Migration
- Polynomiality for Bin Packing with a Constant Number of Item Types
- Convex separable optimization is not much harder than linear optimization
This page was built for publication: Tightness of sensitivity and proximity bounds for integer linear programs
