Combinatorial n-fold integer programming and applications
From MaRDI portal
Publication:5111743
DOI10.4230/LIPICS.ESA.2017.54zbMATH Open1442.90129MaRDI QIDQ5111743FDOQ5111743
Recommendations
Cites Work
- A polynomial oracle-time algorithm for convex integer minimization
- A structural approach to kernels for ILPs: treewidth and total unimodularity
- Algebraic and geometric ideas in the theory of discrete optimization
- Algorithmic meta-theorems for restrictions of treewidth
- Combinatorial \(n\)-fold integer programming and applications
- Efficient algorithms for consensus string problems minimizing both distance sum and radius
- Elections with few candidates: prices, weights, and covering problems
- Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- Graph Layout Problems Parameterized by Vertex Cover
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems
- Huge multiway table problems
- Integer Programming with a Fixed Number of Variables
- Integer optimization on convex semialgebraic sets
- Mathematical Foundations of Computer Science 2004
- Minkowski's Convex Body Theorem and Integer Programming
- Multivariate algorithmics for NP-hard string problems
- Multivariate complexity analysis of Swap Bribery
- Nonlinear discrete optimization. An algorithmic theory
- On covering problems of codes
- On polynomial kernels for sparse integer linear programs
- Parameterized Algorithms for Modular-Width
- Parameterized algorithms
- Parameterized complexity analysis for the closest string with wildcards problem
- Parameterized complexity of distance labeling and uniform channel assignment problems
- Polynomiality for bin packing with a constant number of item types
- Scheduling and fixed-parameter tractability
- Scheduling meets \(n\)-fold integer programming
- The complexity landscape of decompositional parameters for ILP
- Voting and bribing in single-exponential time
- \(n\)-fold integer programming in cubic time
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
- The support of integer optimal solutions
- Parameterized complexity of machine scheduling: 15 open problems
- Near-linear time algorithm for \(n\)-fold ILPs via color coding
- Integer programming in parameterized complexity: three miniatures
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- Mathematical programming formulations for the collapsed k-core problem
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- 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 no real title available?)
- Evaluating and tuning \(n\)-fold integer programming
- The clever shopper problem
- Tight complexity lower bounds for integer linear programming with few constraints
- 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
- Title not available (Why is no real title available?)
- Combinatorial \(n\)-fold integer programming and applications
- 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)
