Bounds on the size of branch-and-bound proofs for integer knapsacks (Q924879): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: Hard Equality Constrained Integer Knapsacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a linear diophantine problem of Frobenius / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3822244 / 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: Lattice translates of a polytope and the Frobenius problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Frobenius Problem and Maximal Lattice Free Bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear diophantine problem of Frobenius. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4054818 / rank
 
Normal rank

Revision as of 10:02, 28 June 2024

scientific article
Language Label Description Also known as
English
Bounds on the size of branch-and-bound proofs for integer knapsacks
scientific article

    Statements

    Identifiers