A polyhedral study on 0-1 knapsack problems with set packing constraints (Q1785756): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.orl.2016.01.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2287267874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the Knapsack Polytope From Minimal Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: New facets for the set packing polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet Obtaining Procedures for Set Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wheel inequalities for stable set polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated multiple allocation hub location problem: Formulations and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic set packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifted cover facets of the 0-1 knapsack polytope with GUB constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: (1,k)-configurations and facets for packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of facet producing graphs for vertex packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Auctions: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(0/1\) knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easily Computable Facets of the Knapsack Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting / rank
 
Normal rank

Latest revision as of 18:01, 16 July 2024

scientific article
Language Label Description Also known as
English
A polyhedral study on 0-1 knapsack problems with set packing constraints
scientific article

    Statements

    A polyhedral study on 0-1 knapsack problems with set packing constraints (English)
    0 references
    0 references
    0 references
    1 October 2018
    0 references
    knapsack polytope
    0 references
    cover inequality
    0 references
    facets
    0 references
    set packing polytope
    0 references

    Identifiers

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