Evaluating and tuning n-fold integer programming
From MaRDI portal
Evaluating and tuning \(n\)-fold integer programming
Recommendations
- \(n\)-fold integer programming in cubic time
- Combinatorial \(n\)-fold integer programming and applications
- Combinatorial \(n\)-fold integer programming and applications
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- High-multiplicity \(N\)-fold IP via configuration LP
Cites work
- A closer look at the closest string and closest substring problem
- A feasibility pump heuristic for general mixed-integer problems
- Algebraic and geometric ideas in the theory of discrete optimization
- Combinatorial \(n\)-fold integer programming and applications
- Covering a tree with rooted subtrees -- parameterized and approximation algorithms
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems
- Local branching
- Lower bounds on the graver complexity of M-fold matrices
- Measuring the impact of primal heuristics
- Mixed integer programming computation
- Nonlinear discrete optimization. An algorithmic theory
- Planning problems in public transit
- Production Planning by Mixed Integer Programming
- Recent Improvements Using Constraint Integer Programming for Resource Allocation and Scheduling
- Voting and bribing in single-exponential time
- \(n\)-fold integer programming in cubic time
Cited in
(11)- Combinatorial \(n\)-fold integer programming and applications
- Theory and Applications of n-Fold Integer Programming
- Near-linear time algorithm for n-fold ILPs via color coding
- Integer programming in parameterized complexity: three miniatures
- Integer programming in parameterized complexity: five miniatures
- A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\)
- scientific article; zbMATH DE number 7561568 (Why is no real title available?)
- The clever shopper problem
- Block-structured integer programming: can we parameterize without the largest coefficient?
- \(n\)-fold integer programming in cubic time
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
Describes a project that uses
Uses Software
This page was built for publication: Evaluating and tuning \(n\)-fold integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140719)
