A cut-and-branch algorithm for the quadratic knapsack problem (Q2673234): Difference between revisions

From MaRDI portal
Changed an 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 / OpenAlex ID
 
Property / OpenAlex ID: W1464660497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Solution of the Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic knapsack problem -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behavior of the quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming for the \(0-1\) quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semidefinite programming approach to the quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the knapsack polytope / 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: Separation algorithms for 0-1 knapsack polytopes / 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: 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
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean quadratic polytope: Some characteristics, facets and relatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-cut clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Heuristic for the Quadratic Knapsack Problem / 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: Cutting planes for RLT relaxations of mixed 0-1 polynomial programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new family of facet defining inequalities for the maximum edge-weighted clique problem / rank
 
Normal rank

Latest revision as of 07:13, 29 July 2024

scientific article
Language Label Description Also known as
English
A cut-and-branch algorithm for the quadratic knapsack problem
scientific article

    Statements

    A cut-and-branch algorithm for the quadratic knapsack problem (English)
    0 references
    0 references
    0 references
    9 June 2022
    0 references
    knapsack problems
    0 references
    cutting planes
    0 references
    integer programming
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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