On inequalities with bounded coefficients and pitch for the min knapsack polytope (Q2673233): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Bienstock, Daniel / rank
Normal rank
 
Property / author
 
Property / author: Bienstock, Daniel / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2020.100567 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3008761481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP-Based Algorithms for Capacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate formulations for 0-1 knapsack sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset Algebra Lift Operators for 0-1 Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of cover inequality separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate fixed-rank closures of covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: High degree sum of squares proofs, Bienstock-Zuckerberg hierarchy and CG cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bounded pitch inequalities for the MIN-knapsack polytope / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:13, 29 July 2024

scientific article
Language Label Description Also known as
English
On inequalities with bounded coefficients and pitch for the min knapsack polytope
scientific article

    Statements

    On inequalities with bounded coefficients and pitch for the min knapsack polytope (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 June 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    minimum knapsack
    0 references
    bounded pitch
    0 references
    bounded coefficients
    0 references
    separation algorithm
    0 references
    integrality gap
    0 references
    0 references