Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302): 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 / describes a project that uses
 
Property / describes a project that uses: Knapsack / rank
 
Normal rank
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.ejor.2006.09.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048804785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / 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: A Heuristic Method for the Set Covering Problem / 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: Q4321552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic assignment problem. Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian-based heuristic for large-scale set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cut polytope and the Boolean quadric polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Parametric Maximum Flow Algorithm and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A level-2 reformulation-linearization technique bound for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Network Flow Problems Solved with Pseudo-Boolean Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roof duality, complementation and persistency in quadratic 0–1 optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual framework for lower bounds of the quadratic assignment problem based on linearization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds and exact algorithms for \(p\)-dispersion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4550779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:35, 27 June 2024

scientific article
Language Label Description Also known as
English
Constrained 0-1 quadratic programming: basic approaches and extensions
scientific article

    Statements

    Constrained 0-1 quadratic programming: basic approaches and extensions (English)
    0 references
    0 references
    21 January 2008
    0 references
    bounding procedures
    0 references
    Lagrangian relaxation
    0 references
    reformulation
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers