Research map / Learning theory and algorithms / Combinatorial and search optimization
A Parallelizable Acceleration Framework for Packing Linear Programs
Palma London, Shai Vardi, Adam Wierman, Hanling Yi
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use a sampled LP and thresholding to extend its dual prices to the full problem | Gurobi on randomly generated packing LPs · Random packing LPs | speedup: more than 150× | Improved |
| Use a sampled LP and thresholding to extend its dual prices to the full problem | Gurobi on randomly generated packing LPs · Random packing LPs | relative error: <4% | Improved |
| Use a sampled LP and thresholding to extend its dual prices to the full problem | Gurobi on the California road network resource-allocation LP · California road network resource allocation | speedup: more than 30 | Improved |
| Use a smaller sample of variables (ablation) | Acceleration framework · Packing LPs | speedup | Improved |
| Use a smaller sample of variables (ablation) | Acceleration framework · Packing LPs | solution quality | Hurt |
| Add speculative execution with multiple clones (ablation) | Accelerated Gurobi · Random packing LPs | speedup: triples the speedup | Improved |
| Add speculative execution with multiple clones (ablation) | Accelerated Gurobi · Random packing LPs | relative error: 12% | Improved |
Closest papers by meaning
- Solving Linear Programs with Fast Online Learning Algorithms (ICML 2023 · similarity 0.86)
- Batched First-Order Methods for Parallel LP Solving in MIP (ICML 2026 · similarity 0.85)
- Fast, Scalable, Warm-Start Semidefinite Programming with Spectral Bundling and Sketching (ICML 2024 · similarity 0.84)
- Optimal Acceleration for Minimax and Fixed-Point Problems is Not Unique (ICML 2024 · similarity 0.83)
- Learning to Remove Cuts in Integer Linear Programming (ICML 2024 · similarity 0.83)
- The Geometry of Linear Program Compression: An Exact Characterization and Learning Algorithm (NeurIPS 2026 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
