scientific article; zbMATH DE number 7286683

DOI10.4230/LIPIcs.SEA.2018.10zbMath1496.90036arXiv1802.09007MaRDI QIDQ5140719

Kateřina Altmanová, Martin Koutecký, Dušan Knop

Publication date: 16 December 2020

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

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

zbMATH Keywords

integer programminglocal searchanalysis of algorithmsprimal heuristic\(n\)-fold integer programming

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Integer programming (90C10)

Related Items (6)

Integer programming in parameterized complexity: five miniatures ⋮ A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\) ⋮ Integer Programming in Parameterized Complexity: Three Miniatures. ⋮ Unnamed Item ⋮ The clever shopper problem ⋮ Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting

Uses Software

• SageMath
• MIPLIB
• Gurobi
• 4ti2
• GLPK
• COIN-OR
• Matplotlib
• Jupyter

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds on the graver complexity of \(M\)-fold matrices
• Nonlinear discrete optimization. An algorithmic theory
• Local branching
• Exploring relaxation induced neighborhoods to improve MIP solutions
• \(n\)-fold integer programming in cubic time
• Graver basis and proximity techniques for block-structured separable convex integer minimization problems
• Measuring the impact of primal heuristics
• A feasibility pump heuristic for general mixed-integer problems
• Planning Problems in Public Transit
• Mixed Integer Programming Computation
• Recent Improvements Using Constraint Integer Programming for Resource Allocation and Scheduling
• A Closer Look at the Closest String and Closest Substring Problem
• Production Planning by Mixed Integer Programming

This page was built for publication: