(Near)-optimal algorithms for sparse separable convex integer programs
From MaRDI portal
Cites work
- \(N\)-fold integer programming
- \(n\)-fold integer programming in cubic time
- A faster parameterized algorithm for treedepth
- A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- About the complexity of two-stage stochastic IPs
- Algebraic and geometric ideas in the theory of discrete optimization
- Best subset selection via a modern optimization lens
- Collapsing the tower -- on the complexity of multistage stochastic IPs
- Combinatorial \(n\)-fold integer programming and applications
- Convex separable optimization is not much harder than linear optimization
- Decomposition of test sets in stochastic integer programming
- Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity
- Empowering the configuration-IP: new PTAS results for scheduling with setup times
- Fast algorithms for separable linear programs
- Faster Algorithms for Integer Programs with Block Structure
- Finiteness theorems in stochastic integer programming
- Geometric algorithms and combinatorial optimization.
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems
- High-multiplicity \(N\)-fold IP via configuration LP
- scientific article; zbMATH DE number 7788439 (Why is no real title available?)
- Integer programming in parameterized complexity: five miniatures
- Iterative methods in combinatorial optimization.
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- Maximum flow and minimum-cost flow in almost-linear time
- Mixed integer linear programming in process scheduling: modeling, algorithms, and applications
- Near-linear time algorithm for n-fold ILPs via color coding
- Network flows. Theory, algorithms, and applications.
- Network hub location problems: The state of the art
- Nonlinear discrete optimization. An algorithmic theory
- On Mixed-Integer Programming Formulations for the Unit Commitment Problem
- On the foundations of linear and integer linear programming I
- Parameterized algorithms for block-structured integer programs with large entries
- Parameterized and approximation results for scheduling with a low rank processing time matrix
- Parameterized complexity of configuration integer programs
- Presolve Reductions in Mixed Integer Programming
- Proximity theorems of discrete convex functions
- Reducibility among combinatorial problems
- Reducibility bounds of objective functions over the integers
- Scheduling meets n-fold integer programming
- Strong mixed-integer programming formulations for trained neural networks
- The double exponential runtime is tight for 2-stage stochastic ILPs
- Tight complexity lower bounds for integer linear programming with few constraints
- Tight lower bounds for block-structured integer programs
- Two-dimensional packing problems: a survey
- Two‐stage stochastic integer programming: a survey
- Using separation algorithms in fixed dimension
This page was built for publication: (Near)-optimal algorithms for sparse separable convex integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6880127)
