Separable convex mixed-integer optimization: improved algorithms and lower bounds

Cites work

scientific article; zbMATH DE number 3121293 (Why is no real title available?)
scientific article; zbMATH DE number 7788439 (Why is no real title available?)
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
A polynomial-time descent method for separable convex optimization problems with linear constraints
Bedingt konvergente Reihen und konvexe Systeme. (Schluß.).
Best subset selection via a modern optimization lens
Collapsing the tower -- on the complexity of multistage stochastic IPs
Convex separable optimization is not much harder than linear optimization
Distances between optimal solutions of mixed-integer programs
Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity
Finiteness theorems in stochastic integer programming
Fixed-parameter tractability and completeness II: On completeness for W[1]
High-multiplicity \(N\)-fold IP via configuration LP
Integer Programming with a Fixed Number of Variables
Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
Network Formulations of Mixed-Integer Programs
On Integer Programming, Discrepancy, and Convolution
On the positive sums property and the computation of Graver test sets
Parameterized algorithms for block-structured integer programs with large entries
Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
Solving Real-World Linear Programs: A Decade and More of Progress
The double exponential runtime is tight for 2-stage stochastic ILPs
To the Steinitz lemma in coordinate form

This page was built for publication: Separable convex mixed-integer optimization: improved algorithms and lower bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253088)