Column basis reduction and decomposable knapsack problems (Q834182): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disopt.2009.01.003 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: LattE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064684117 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0807.1317 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of polynomial time lattice basis reduction algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski's Convex Body Theorem and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective lattice point counting in rational convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generalized Basis Reduction Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices / 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: A Class of Hard Small 0-1 Programs / 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: Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Equality Constrained Integer Knapsacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trivial integer programs unsolvable by branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of integer programs and of generating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chvátal closures for mixed integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the separation of split cuts and related inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lovász' lattice reduction and the nearest lattice point problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3274590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent Integer Programs and Canonical Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal all-integer algorithm based on irreducible solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Continuous Discretely / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISOPT.2009.01.003 / rank
 
Normal rank

Latest revision as of 04:40, 10 December 2024

scientific article
Language Label Description Also known as
English
Column basis reduction and decomposable knapsack problems
scientific article

    Statements

    Column basis reduction and decomposable knapsack problems (English)
    0 references
    0 references
    0 references
    19 August 2009
    0 references
    integer programming
    0 references
    split disjunctions
    0 references
    basis reduction
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers