Combinatorial n-fold integer programming and applications
From MaRDI portal
Publication:5111743
DOI10.4230/LIPICS.ESA.2017.54zbMATH Open1442.90129MaRDI QIDQ5111743FDOQ5111743
Authors: Dušan Knop, Martin Koutecký, Matthias Mnich 
Publication date: 27 May 2020
Recommendations
Analysis of algorithms (68W40) Combinatorial optimization (90C27) Integer programming (90C10) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- Algorithmic meta-theorems for restrictions of treewidth
- Integer Programming with a Fixed Number of Variables
- Minkowski's Convex Body Theorem and Integer Programming
- Algebraic and geometric ideas in the theory of discrete optimization
- Polynomiality for Bin Packing with a Constant Number of Item Types
- Parameterized Algorithms
- A polynomial oracle-time algorithm for convex integer minimization
- On covering problems of codes
- On polynomial kernels for sparse integer linear programs
- Parameterized Algorithms for Modular-Width
- Graph Layout Problems Parameterized by Vertex Cover
- Multivariate complexity analysis of Swap Bribery
- \(n\)-fold integer programming in cubic time
- Nonlinear discrete optimization. An algorithmic theory
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems
- Elections with Few Candidates: Prices, Weights, and Covering Problems
- Scheduling meets \(n\)-fold integer programming
- Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
- Parameterized complexity analysis for the closest string with wildcards problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Integer optimization on convex semialgebraic sets
- Efficient algorithms for consensus string problems minimizing both distance sum and radius
- Mathematical Foundations of Computer Science 2004
- Scheduling and fixed-parameter tractability
- Parameterized complexity of distance labeling and uniform channel assignment problems
- The complexity landscape of decompositional parameters for ILP
- A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity
- Title not available (Why is that?)
- Huge multiway table problems
Cited In (26)
- Optimal schemes for combinatorial query problems with integer feedback
- Combinatorial flexibility problems and their computational complexity
- Theory and Applications of n-Fold Integer Programming
- About the complexity of two-stage stochastic IPs
- Parameterized complexity of machine scheduling: 15 open problems
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- Title not available (Why is that?)
- Mathematical programming formulations for the collapsed k-core problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parameterized complexity of a coupled-task scheduling problem
- Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
- \(N\)-fold integer programming and nonlinear multi-transshipment
- The last dozen of years of or research in Czechia and Slovakia
- Title not available (Why is that?)
- The Support of Integer Optimal Solutions
- The clever shopper problem
- About the Complexity of Two-Stage Stochastic IPs
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
- Faster Algorithms for Integer Programs with Block Structure
- Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding
- Integer Programming in Parameterized Complexity: Three Miniatures.
- Title not available (Why is that?)
- Combinatorial \(n\)-fold integer programming and applications
This page was built for publication: Combinatorial \(n\)-fold integer programming and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111743)
