On the complexity of separation from the knapsack polytope (Q2164691): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3213324146 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2111.06556 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cover and pack inequalities for (mixed) integer programming / 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: Multi-cover inequalities for totally-ordered multiple knapsack sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multiple Knapsack Problems by Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifted Cover Inequalities for 0-1 Integer Programs: Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation algorithms for 0-1 knapsack polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of cover inequality separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lifted cover inequalities: a new lifting procedure with unusual properties / 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: (1,k)-configurations and facets for packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multidimensional Knapsack Problem: Structure and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(0/1\) knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faces for a linear inequality in 0–1 variables / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:21, 29 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of separation from the knapsack polytope
scientific article

    Statements

    On the complexity of separation from the knapsack polytope (English)
    0 references
    0 references
    0 references
    0 references
    16 August 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    knapsack polytope
    0 references
    separation problem
    0 references
    complexity theory
    0 references
    0 references
    0 references