Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10957-010-9653-x / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: BARON / 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/s10957-010-9653-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2057612461 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57445463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for an integer quadratic non-separable transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomially Solvable Cases of Binary 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: Lower bound improvement and forcing rule for quadratic binary programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Seizure warning algorithm based on optimization and nonlinear dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained 0-1 quadratic programming: basic approaches and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic knapsack problem -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nonlinear knapsack problem - algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution method to solve large scale integer quadratic multidimensional knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent Lagrangian and Contour Cut Method for Nonlinear Integer Programming with a Quadratic Objective Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for indefinite integer quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization techniques for solving the general quadratic integer programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking in quadratic integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An enumerative algorithm framework for a class of nonlinear integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for global minimization of linearly constrained quadratic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of indefinite quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained global optimization: algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of large-scale constrained concave quadratic problems by separable programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-convexification approach for solving nonconvex quadratic programming problems / 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: A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ellipsoidal approach to box-constrained quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear programming reformulation of the standard quadratic optimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new semidefinite programming bound for indefinite quadratic forms over a simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut algorithm for hub location problems with single assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral study of nonconvex quadratic programs with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral approach for nonconvex quadratic programming problems with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex separable optimization is not much harder than linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent Lagrangian and domain cut method for nonlinear knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040299 / 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: Congruence Diagonalization and Lie Groups / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10957-010-9653-X / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:03, 9 December 2024

scientific article
Language Label Description Also known as
English
Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
scientific article

    Statements

    Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (English)
    0 references
    0 references
    10 November 2010
    0 references
    quadratic integer programming
    0 references
    separable relaxation
    0 references
    semiunimodular congruence transformation
    0 references
    Lagrangian relaxation
    0 references
    convex relaxation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers