Ellipsoid Bounds for Convex Quadratic Integer Programming (Q2954394): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/130929187 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1993661885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue Techniques for Convex Objective, Nonconvex Optimization 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: An efficient compact quadratic convex reformulation for general integer quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxations for non-convex quadratic mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective branch-and-bound algorithm for convex quadratic integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The MILP Road to MIQCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some proximity and sensitivity results in quadratic integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and Bound Experiments in Convex Nonlinear Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: When is rounding allowed in integer nonlinear optimization? / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implicit Enumeration Algorithm for Quadratic Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:44, 13 July 2024

scientific article
Language Label Description Also known as
English
Ellipsoid Bounds for Convex Quadratic Integer Programming
scientific article

    Statements

    Ellipsoid Bounds for Convex Quadratic Integer Programming (English)
    0 references
    0 references
    0 references
    0 references
    13 January 2017
    0 references
    quadratic integer programming
    0 references
    ellipsoidal approximation
    0 references
    branch-and-bound
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references