Extensions on ellipsoid bounds for quadratic integer programming (Q721161): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 01:47, 10 December 2024

scientific article

Language	Label	Description	Also known as
English	Extensions on ellipsoid bounds for quadratic integer programming	scientific article

Statements

scholarly article

0 references

Extensions on ellipsoid bounds for quadratic integer programming (English)

0 references

Francisco Pinillos Nieto

0 references

Márcia H. C. Fampa

0 references

Journal of Global Optimization

0 references

publication date

18 July 2018

0 references

zbMATH Keywords

quadratic integer programming

0 references

ellipsoid bound

0 references

integer relaxation

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10898-017-0557-2

0 references

Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming

0 references

The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems

0 references

Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons

0 references

A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations

0 references

An effective branch-and-bound algorithm for convex quadratic integer programming

0 references

Ellipsoid Bounds for Convex Quadratic Integer Programming

0 references

A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations

0 references

An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations

0 references

Ellipsoidal approach to box-constrained quadratic problems

0 references

On global optimization with indefinite quadratics

0 references

Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

DC programming: overview.

0 references

When is rounding allowed in integer nonlinear optimization?

0 references

A continuous method for computing bounds in integer quadratic optimization problems

0 references

A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems

0 references

On the Shannon capacity of a graph

0 references

Cones of Matrices and Set-Functions and 0–1 Optimization

0 references

Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems

0 references

Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations

0 references

Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations

0 references

Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations

0 references

A reformulation-linearization technique for solving discrete and continuous nonconvex problems

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1007/S10898-017-0557-2

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:721161

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q721161&oldid=38458544"