The complexity landscape of decompositional parameters for ILP

Alumur, 2008, Network hub location problems: the state of the art, Eur. J. Oper. Res., 190, 1, 10.1016/j.ejor.2007.06.008 Courcelle, 2000, Linear time solvable optimization problems on graphs of bounded clique-width, Theory Comput. Syst., 33, 125, 10.1007/s002249910009 Cunningham, 2007, On integer programming and the branch-width of the constraint matrix, vol. 4513, 158 Cygan, 2015 De Loera, 2013, Algebraic and Geometric Ideas in the Theory of Discrete Optimization, vol. 14 Diestel, 2012, Graph Theory, vol. 173 Downey, 2013, Fundamentals of Parameterized Complexity, 10.1007/978-1-4471-5559-1 Fellows, 2008, Graph layout problems parameterized by vertex cover, 294 Fischer, 2008, Counting truth assignments of formulas of bounded tree-width or clique-width, Discrete Appl. Math., 156, 511, 10.1016/j.dam.2006.06.020 Floudas, 2005, Mixed integer linear programming in process scheduling: modeling, algorithms, and applications, Ann. Oper. Res., 139, 131, 10.1007/s10479-005-3446-x Flum, 2006, Parameterized Complexity Theory, vol. XIV Frank, 1987, An application of simultaneous diophantine approximation in combinatorial optimization, Combinatorica, 7, 49, 10.1007/BF02579200 Ganian, 2015, Community structure inspired algorithms for SAT and #SAT, vol. 9340, 294 Ganian, 2013, Better algorithms for satisfiability problems for formulas of bounded rank-width, Fundam. Inform., 123, 59, 10.3233/FI-2013-800 Ganian, 2015, Algorithmic applications of tree-cut width, 348 Garey, 1979 Gaspers, 2012, Backdoors to satisfaction, vol. 7370, 287 Gutin, 2015, Structural parameterizations of the Mixed Chinese Postman Problem, 668 Hemmecke, 2013, N-fold integer programming in cubic time, Math. Program., 137, 325, 10.1007/s10107-011-0490-y Jansen, 2015, A structural approach to kernels for ILPs: treewidth and total unimodularity, vol. 9294, 779 Kannan, 1987, Minkowski's convex body theorem and integer programming, Math. Oper. Res., 12, 415, 10.1287/moor.12.3.415 Lenstra, 1983, Integer programming with a fixed number of variables, Math. Oper. Res., 8, 538, 10.1287/moor.8.4.538 Lodi, 2002, Two-dimensional packing problems: a survey, Eur. J. Oper. Res., 141, 241, 10.1016/S0377-2217(02)00123-6 Nešetřil, 2012, Sparsity: Graphs, Structures, and Algorithms, vol. 28 Niedermeier, 2006 Onn, 2010, Nonlinear Discrete Optimization, 10.4171/093 Papadimitriou, 1982 Papadimitriou, 1981, On the complexity of integer programming, J. ACM, 28, 765, 10.1145/322276.322287 Szeider, 2003, Finding paths in graphs avoiding forbidden transitions, Discrete Appl. Math., 126, 239 2001 van den Briel, 2005, Reviving integer programming approaches for AI planning: a branch-and-cut framework, 310 Vossen, 1999, On the use of integer programming models in AI planning, 304