Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs / 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: Mixed-integer bilinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method / 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: The indefinite zero-one quadratic problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3270229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Adaptive Memory Tabu Search for Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Miniaturized'' linearizations for quadratic 0/1 problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613011 / 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: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An evolutionary heuristic for quadratic 0-1 programming / 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: Greedy and local search heuristics for unconstrained binary quadratic programming / 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: A reformulation-convexification approach for solving nonconvex quadratic programming problems / rank
 
Normal rank

Latest revision as of 20:38, 28 June 2024

scientific article
Language Label Description Also known as
English
Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
scientific article

    Statements

    Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (English)
    0 references
    0 references
    0 references
    0 references
    19 November 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial optimization
    0 references
    quadratic 0-1 programming
    0 references
    linear reformulation
    0 references
    quadratic convex reformulation
    0 references
    0 references
    0 references
    0 references
    0 references