Decomposition of integer programs and of generating sets

DOI10.1007/3-540-63397-9_8MaRDI QIDQ826076zbMATH OpenOpenAlexFDO

Authors R. Urbaniak, Gérard Cornuéjols, Robert Weismantel, Laurence A. Wolsey

Publication date 20 December 2021

Full work available at URL https://doi.org/10.1007/3-540-63397-9_8

zbMATH Keywords

integer programmingknapsack problemscalinggenerating settest setgroup-theoretic approachprimal method

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• Group-theoretic method of decomposition methods in integer linear programming
• scientific article; zbMATH DE number 1110374
• Decomposing finitely generated integral monoids by elimination
• Integral decomposition of polyhedra and some applications in mixed integer programming
• Non-standard approaches to integer programming

Cited in

(11)

• Computing generating sets of lattice ideals and Markov bases of lattices
• scientific article; zbMATH DE number 1216241 (Why is no real title available?)
• Nondecomposable solutions to group equations and an application to polyhedral combinatorics
• Regular decomposition in integer programming
• Initial ideals of unimodular integer programs
• Group-theoretic method of decomposition methods in integer linear programming
• Integral decomposition of polyhedra and some applications in mixed integer programming
• Column basis reduction and decomposable knapsack problems
• Décomposition en matrices graphiques de matrices en $\lbrace 0, 1, -1\rbrace $ : application à la résolution de programmes linéaires entiers
• A computational study of integer programming algorithms based on Barvinok's rational functions
• Non-standard approaches to integer programming

This page was built for publication: Decomposition of integer programs and of generating sets

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