A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting (Q429687): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2010.09.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973223260 / 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
Property / cites work
 
Property / cites work: Second-order cover inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid Inequalities and Superadditivity for 0–1 Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence independent lifting in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence Independent Lifting for Mixed-Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 0-1 knapsack problem with a single continuous variable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facets of the mixed-integer knapsack polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence independent lifting for mixed integer programs with variable upper bounds / 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: Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the knapsack problem with special ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications / rank
 
Normal rank

Latest revision as of 09:38, 5 July 2024

scientific article
Language Label Description Also known as
English
A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
scientific article

    Statements

    A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting (English)
    0 references
    0 references
    20 June 2012
    0 references
    0 references
    knapsack
    0 references
    cardinality constraint
    0 references
    cutting plane
    0 references
    sequence-independent lifting
    0 references
    0 references