z-logo
HomeZAIABlog
open-access-imgOpen Access
DECOMPOSITION AND RELAXATION ALGORITHMS FOR NONCONVEX MIXED INTEGER QUADRATICALLY CONSTRAINED QUADRATIC PROGRAMMING PROBLEMS
Author(s) -
TIAGO COUTINHO CARNEIRO DE ANDRADE
Publication year - 2018
Language(s) - English
Resource type - Dissertations/theses
DOI - 10.17771/pucrio.acad.37845
Subject(s) - quadratic growth , relaxation (psychology) , solver , quadratic programming , quadratic equation , lagrangian relaxation , mathematics , benchmark (surveying) , mathematical optimization , quadratically constrained quadratic program , integer programming , integer (computer science) , decomposition , binary number , algorithm , computer science , psychology , social psychology , geometry , programming language , ecology , arithmetic , geodesy , biology , geography

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom

About

AboutCareersPublisher PartnersContact UsGet Organisational Trial or Quote

Learn

FAQsBlogTerms of UsePrivacy Policy

Download the Zendy App

Get it on
Google Play
Download on the
App Store

Discover

Explore

Copyright Knowledge E © 2026. All Rights Reserved.