Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Extensions on ellipsoid bounds for quadratic integer programming - MaRDI portal

Extensions on ellipsoid bounds for quadratic integer programming (Q721161)

From MaRDI portal

Jump to:navigation, search

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use this page instead for the normal view: Extensions on ellipsoid bounds for quadratic integer programming

scientific article; zbMATH DE number 6905228

Language	Label	Description	Also known as
English	Extensions on ellipsoid bounds for quadratic integer programming	scientific article; zbMATH DE number 6905228

Statements

scholarly article

0 references

Extensions on ellipsoid bounds for quadratic integer programming (English)

0 references

Francisco Pinillos Nieto

0 references

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

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

Recommended article

Ellipsoid Bounds for Convex Quadratic Integer Programming

Similarity Score

0.9710829

Recommender Run

Recommender Run 2

0 references

Similarity Score

0.92466605

Recommender Run

Recommender Run 2

0 references

Similarity Score

0.92466605

Recommender Run

Recommender Run 2

0 references

An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations

Similarity Score

0.9114144

Recommender Run

Recommender Run 2

0 references

Une borne optimale pour la programmation entière quasi-convexe

Similarity Score

0.90870345

Recommender Run

Recommender Run 2

0 references

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

Similarity Score

0.9037603

Recommender Run

Recommender Run 2

0 references

An objective-function ellipsoid-algorithm for convex quadraical programming

Similarity Score

0.9003214

Recommender Run

Recommender Run 2

0 references

Similarity Score

0.89828646

Recommender Run

Recommender Run 2

0 references

Extension of Eaves theorem for determining the boundedness of convex quadratic programming problems

Similarity Score

0.89718544

Recommender Run

Recommender Run 2

0 references

Similarity Score

0.89708847

Recommender Run

Recommender Run 2

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=42659727"