On integer programs that look like paths

DOI10.1007/978-3-032-28691-8_11MaRDI QIDQ7349454zbMATH OpenFDO

Authors Marcin Briański, Alexandra Lassota, Kristýna Pekárková, Michał Pilipczuk, Janina Reuter

Publication date 16 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-28691-8_11

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Cites work

• \(n\)-fold integer programming in cubic time
• A structural approach to kernels for ILPs: treewidth and total unimodularity
• Collapsing the tower -- on the complexity of multistage stochastic IPs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Decomposition of test sets in stochastic integer programming
• Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity
• Empowering the configuration-IP: new PTAS results for scheduling with setup times
• Fixed-parameter algorithms for CLOSEST STRING and related problems
• Graph Layout Problems Parameterized by Vertex Cover
• Integer programming and incidence treedepth
• Integer programming in parameterized complexity: five miniatures
• Integer Programming with a Fixed Number of Variables
• On minimizing tardy processing time, Max-Min skewed convolution, and triangular structured ILPs
• Parameterized complexity of distance labeling and uniform channel assignment problems
• Polynomiality for Bin Packing with a Constant Number of Item Types
• Sparsity. Graphs, structures, and algorithms
• The complexity landscape of decompositional parameters for ILP
• The complexity of theorem-proving procedures
• Voting schemes for which it can be difficult to tell who won the election

This page was built for publication: On integer programs that look like paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349454)