\(O(n \log n)\) procedures for tightening cover inequalities (Q1124826): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Facets of the Knapsack Polytope From Minimal Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of mathematical programming problems prior to applying the simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tightening cover induced inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient reformulation for 0-1 programs -- methods and computational results / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Dietrich-Escudero approach for solving the \(0-1\) knapsack problem with a \(0-1\) objective function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence independent lifting of cover inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of vertex packing and independence system polyhedra / 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: Technical Note—A Note on Zero-One Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Mixed Integer Programming Problems Using Automatic Reformulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong formulations for mixed integer programming: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easily Computable Facets of the Knapsack Polytope / rank
 
Normal rank

Latest revision as of 10:54, 29 May 2024

scientific article
Language Label Description Also known as
English
\(O(n \log n)\) procedures for tightening cover inequalities
scientific article

    Statements

    \(O(n \log n)\) procedures for tightening cover inequalities (English)
    0 references
    28 November 1999
    0 references
    0 references
    0-1 program
    0 references
    cover
    0 references
    clique
    0 references
    probing
    0 references
    knapsack constraint
    0 references
    coefficient increase
    0 references
    lifting
    0 references
    0 references