scientific article; zbMATH DE number 7651172

DOI10.4230/LIPIcs.ESA.2020.33MaRDI QIDQ5874501

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

Publication date: 7 February 2023

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

integer programminggraver basisfixed parameter tractable

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (5)

A colorful Steinitz lemma with application to block-structured integer programs ⋮ Block-structured integer programming: can we parameterize without the largest coefficient? ⋮ The double exponential runtime is tight for 2-stage stochastic ILPs ⋮ The double exponential runtime is tight for 2-stage stochastic ILPs ⋮ About the complexity of two-stage stochastic IPs

Cites Work

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

This page was built for publication: