Thinner is not always better: cascade knapsack problems (Q1727953): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MIPLIB / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2567428825 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1612.08588 / 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: Lattice based extended formulations for integer linear equality systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Knapsack Problems / 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: Q3840366 / 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: Bounds on the size of branch-and-bound proofs for integer knapsacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column basis reduction and decomposable knapsack problems / 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: Factoring polynomials with rational coefficients / 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: The Generalized Basis Reduction Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Selecting Disjunctions in Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417704 / 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: Q3818127 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:16, 18 July 2024

scientific article
Language Label Description Also known as
English
Thinner is not always better: cascade knapsack problems
scientific article

    Statements

    Thinner is not always better: cascade knapsack problems (English)
    0 references
    21 February 2019
    0 references
    branch-and-bound
    0 references
    hyperplane branching
    0 references
    thin direction
    0 references
    column basis reduction
    0 references

    Identifiers

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