Lattice based extended formulations for integer linear equality systems (Q847838): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2522191408 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0702881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Equality Constrained Integer Knapsacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coefficient strengthening: a tool for reformulating mixed-integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformation of integer programs to knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent Integer Programs and Canonical Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coefficient reduction for inequalities in 0–1 variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to the geometry of numbers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Class of Hard Small 0-1 Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3745276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank

Latest revision as of 12:05, 2 July 2024

scientific article
Language Label Description Also known as
English
Lattice based extended formulations for integer linear equality systems
scientific article

    Statements

    Lattice based extended formulations for integer linear equality systems (English)
    0 references
    0 references
    0 references
    19 February 2010
    0 references
    Lattice basis reduction
    0 references
    Integer width
    0 references
    Frobenius number
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references