Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs (Q2386196): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q60395652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple recipe for concise mixed 0-1 linearizations / 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: Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-integer bilinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / 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 for quadratic Boolean programs with applications to quadratic assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis / 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: Improved Linear Integer Programming Formulations of Nonlinear Integer Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the quadratic assignment problem using Benders' decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A conditional logic approach for strengthening mixed 0-1 linear programs / 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: Lagrangean methods for the 0-1 quadratic knapsack problem / 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: A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems / rank
 
Normal rank

Latest revision as of 14:28, 10 June 2024

scientific article
Language Label Description Also known as
English
Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
scientific article

    Statements

    Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs (English)
    0 references
    0 references
    0 references
    0 references
    22 August 2005
    0 references
    0-1 Quadratic program
    0 references
    Reformulation
    0 references
    Linearization
    0 references
    0 references
    0 references
    0 references

    Identifiers