An efficient compact quadratic convex reformulation for general integer quadratic programs (Q1938903): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10589-012-9474-y / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: CSDP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / 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.1007/s10589-012-9474-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039313577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Essays and Surveys in Global Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Links between linear bilevel and mixed 0-1 programming problems / 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: Linear Reformulations of Integer Quadratic Programs / 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: CSDP, A C library for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming algorithms for the optimal cutting of equal rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic heuristic for a computationally difficult set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic global optimization in nonlinear optimal control problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspective cuts for a class of convex 0-1 mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the generalized quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregate line capacity design for PWB assembly systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization. From theory to implementation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP with path-relinking for the generalized quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral branch-and-cut approach to global optimization / 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: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10589-012-9474-Y / rank
 
Normal rank

Latest revision as of 14:16, 16 December 2024

scientific article
Language Label Description Also known as
English
An efficient compact quadratic convex reformulation for general integer quadratic programs
scientific article

    Statements

    An efficient compact quadratic convex reformulation for general integer quadratic programs (English)
    0 references
    0 references
    0 references
    0 references
    25 February 2013
    0 references
    quadratic programming
    0 references
    integer programming
    0 references
    exact convex reformulation
    0 references
    computational experiments
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers