scientific article; zbMATH DE number 7651172

DOI10.4230/LIPICS.ESA.2020.33MaRDI QIDQ5874501FDOQ5874501

Lei Xu, Martin Koutecký, Lin Chen, Weidong (Larry) Shi

Publication date: 7 February 2023

Full work available at URL: https://arxiv.org/abs/1805.03741

Title of this publication is not available (Why is that?)

Recommendations

• On Block-Structured Integer Programming and Its Applications
• scientific article; zbMATH DE number 647691
• On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
• On the augmented Lagrangian dual for integer programming
• Faster Algorithms for Integer Programs with Block Structure
• A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
• An augmented Lagrangian decomposition method for block diagonal linear programming problems
• The blockwise coordinate descent method for integer programs
• Mixed decomposition in block integer linear programming problems
• Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming

zbMATH Keywords

integer programminggraver basisfixed parameter tractable

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Reducibility among Combinatorial Problems
• Lower bounds on the graver complexity of \(M\)-fold matrices
• On the foundations of linear and integer linear programming I
• A polynomial oracle-time algorithm for convex integer minimization
• A finiteness theorem for Markov bases of hierarchical models
• \(N\)-fold integer programming
• Value of the Steinitz constant
• \(n\)-fold integer programming in cubic time
• On the complexity of integer programming
• Nonlinear discrete optimization. An algorithmic theory
• Graver basis and proximity techniques for block-structured separable convex integer minimization problems
• Title not available (Why is that?)
• Scheduling meets \(n\)-fold integer programming
• Finiteness theorems in stochastic integer programming
• Combinatorial \(n\)-fold integer programming and applications
• Title not available (Why is that?)
• Optimization with binet matrices
• Title not available (Why is that?)
• Faster Algorithms for Integer Programs with Block Structure
• A strongly polynomial algorithm for bimodular integer linear programming
• The complexity landscape of decompositional parameters for ILP
• Title not available (Why is that?)
• On Integer Programming and Convolution.
• A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
• Title not available (Why is that?)
• About the Complexity of Two-Stage Stochastic IPs

Cited In (7)

• About the complexity of two-stage stochastic IPs
• The double exponential runtime is tight for 2-stage stochastic ILPs
• FPT algorithms for a special block-structured integer program with applications in scheduling
• The double exponential runtime is tight for 2-stage stochastic ILPs
• On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
• Block-structured integer programming: can we parameterize without the largest coefficient?
• A colorful Steinitz lemma with application to block-structured integer programs

This page was built for publication:

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