Quadratic convex reformulation for quadratic programming with linear on-off constraints (Q1755375): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On handling indicator constraints in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem / 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: Extending the QCR method to general mixed-integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient compact quadratic convex reformulation for general integer quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact quadratic convex reformulations of mixed-integer quadratically constrained problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations / 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: On mathematical programming with indicator constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and nonlinear optimization. Theory and examples. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Lagrangian relaxation for general quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDP diagonalizations and perspective cuts for a class of nonseparable MIQP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Implementations for Nonsmooth Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspective reformulations of mixed integer nonlinear programs with indicator variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-integer nonlinear programs featuring ``on/off'' constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: New reformulations for probabilistically constrained quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs / rank
 
Normal rank

Revision as of 19:12, 17 July 2024

scientific article
Language Label Description Also known as
English
Quadratic convex reformulation for quadratic programming with linear on-off constraints
scientific article

    Statements

    Quadratic convex reformulation for quadratic programming with linear on-off constraints (English)
    0 references
    0 references
    0 references
    0 references
    9 January 2019
    0 references
    integer programming
    0 references
    quadratic convex reformulation
    0 references
    on-off constraint
    0 references
    mixed integer quadratic programming
    0 references
    semidefinite program
    0 references
    0 references

    Identifiers