Integer programming and incidence treedepth

DOI10.1007/978-3-030-17953-3_15zbMath1436.90083arXiv2012.00079OpenAlexW2943060833MaRDI QIDQ2293088

Eduard Eiben, Dušan Knop, Michał Pilipczuk, Robert Ganian, Sebastian Ordyniak, Marcin Wrochna

Publication date: 6 February 2020

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

zbMATH Keywords

computational complexityinteger programmingGaifman graphincidence treedepth

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (3)

Integer programming in parameterized complexity: five miniatures ⋮ An approximation algorithm for indefinite mixed integer quadratic programming ⋮ The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints

This page was built for publication: Integer programming and incidence treedepth