Decomposition of integer programs and of generating sets
From MaRDI portal
Publication:826076
DOI10.1007/3-540-63397-9_8zbMATH Open1482.90120OpenAlexW1584582572MaRDI QIDQ826076FDOQ826076
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
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
integer programmingknapsack problemscalinggenerating settest setgroup-theoretic approachprimal method
Cited In (11)
- Integral decomposition of polyhedra and some applications in mixed integer programming
- Title not available (Why is that?)
- Non-standard approaches to 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
- Nondecomposable solutions to group equations and an application to polyhedral combinatorics
- Regular decomposition in integer programming
- Computing generating sets of lattice ideals and Markov bases of lattices
- Group-theoretic method of decomposition methods in integer linear programming
- A computational study of integer programming algorithms based on Barvinok's rational functions
- Initial ideals of unimodular integer programs
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)
