Loading…

A branch and cut algorithm for nonconvex quadratically constrained quadratic programming

Saved in:

Bibliographic Details
Published in:	Mathematical programming 2000, Vol.87 (1), p.131-152
Main Authors:	AUDET, C, HANSEN, P, JAUMARD, B, SAVARD, G
Format:	Article
Language:	English
Subjects:	Applied sciences Exact sciences and technology Mathematical programming Operational research and scientific management Operational research. Management science
Citations:	Items that cite this one
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

cited_by	cdi_FETCH-LOGICAL-c369t-1321d975af9d066944c1b2fba228fa8498ec8e21d4c61b3f7f7bf1bfcd1046e33
cites
container_end_page	152
container_issue	1
container_start_page	131
container_title	Mathematical programming
container_volume	87
creator	AUDET, C HANSEN, P JAUMARD, B SAVARD, G
description
doi_str_mv	10.1007/s101079900106
format	article
fullrecord	<record><control><sourceid>pascalfrancis_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1007_s101079900106</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1262591</sourcerecordid><originalsourceid>FETCH-LOGICAL-c369t-1321d975af9d066944c1b2fba228fa8498ec8e21d4c61b3f7f7bf1bfcd1046e33</originalsourceid><addsrcrecordid>eNpVkM1LxDAQxYMouK4evefgtTqTpGlzXBa_QPCi4K1M02S30qZr0hX3v7fLCounB_N-8-A9xq4RbhGguEsICIUxMIk-YTNUUmdKK33KZgAiz3KNcM4uUvqEiZFlOWMfC15HCnbNKTTcbkdO3WqI7bjuuR8iD0OwQ_h2P_xrS02ksbXUdTs-HdMYqQ2uOTp8E4dVpL5vw-qSnXnqkrv60zl7f7h_Wz5lL6-Pz8vFS2alNmOGUmBjipy8aUBro5TFWviahCg9lcqUzpZuYpTVWEtf-KL2WHvbICjtpJyz7JBr45BSdL7axLanuKsQqv0s1b9ZJv7mwG8oTVX8vnybjk9Ci9yg_AUlR2OB</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A branch and cut algorithm for nonconvex quadratically constrained quadratic programming</title><source>Business Source Ultimate</source><source>Springer Nature</source><creator>AUDET, C ; HANSEN, P ; JAUMARD, B ; SAVARD, G</creator><creatorcontrib>AUDET, C ; HANSEN, P ; JAUMARD, B ; SAVARD, G</creatorcontrib><identifier>ISSN: 0025-5610</identifier><identifier>EISSN: 1436-4646</identifier><identifier>DOI: 10.1007/s101079900106</identifier><identifier>CODEN: MHPGA4</identifier><language>eng</language><publisher>Heidelberg: Springer</publisher><subject>Applied sciences ; Exact sciences and technology ; Mathematical programming ; Operational research and scientific management ; Operational research. Management science</subject><ispartof>Mathematical programming, 2000, Vol.87 (1), p.131-152</ispartof><rights>2000 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c369t-1321d975af9d066944c1b2fba228fa8498ec8e21d4c61b3f7f7bf1bfcd1046e33</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,4024,27923,27924,27925</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1262591$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>AUDET, C</creatorcontrib><creatorcontrib>HANSEN, P</creatorcontrib><creatorcontrib>JAUMARD, B</creatorcontrib><creatorcontrib>SAVARD, G</creatorcontrib><title>A branch and cut algorithm for nonconvex quadratically constrained quadratic programming</title><title>Mathematical programming</title><subject>Applied sciences</subject><subject>Exact sciences and technology</subject><subject>Mathematical programming</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><issn>0025-5610</issn><issn>1436-4646</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2000</creationdate><recordtype>article</recordtype><recordid>eNpVkM1LxDAQxYMouK4evefgtTqTpGlzXBa_QPCi4K1M02S30qZr0hX3v7fLCounB_N-8-A9xq4RbhGguEsICIUxMIk-YTNUUmdKK33KZgAiz3KNcM4uUvqEiZFlOWMfC15HCnbNKTTcbkdO3WqI7bjuuR8iD0OwQ_h2P_xrS02ksbXUdTs-HdMYqQ2uOTp8E4dVpL5vw-qSnXnqkrv60zl7f7h_Wz5lL6-Pz8vFS2alNmOGUmBjipy8aUBro5TFWviahCg9lcqUzpZuYpTVWEtf-KL2WHvbICjtpJyz7JBr45BSdL7axLanuKsQqv0s1b9ZJv7mwG8oTVX8vnybjk9Ci9yg_AUlR2OB</recordid><startdate>2000</startdate><enddate>2000</enddate><creator>AUDET, C</creator><creator>HANSEN, P</creator><creator>JAUMARD, B</creator><creator>SAVARD, G</creator><general>Springer</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>2000</creationdate><title>A branch and cut algorithm for nonconvex quadratically constrained quadratic programming</title><author>AUDET, C ; HANSEN, P ; JAUMARD, B ; SAVARD, G</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c369t-1321d975af9d066944c1b2fba228fa8498ec8e21d4c61b3f7f7bf1bfcd1046e33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2000</creationdate><topic>Applied sciences</topic><topic>Exact sciences and technology</topic><topic>Mathematical programming</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>AUDET, C</creatorcontrib><creatorcontrib>HANSEN, P</creatorcontrib><creatorcontrib>JAUMARD, B</creatorcontrib><creatorcontrib>SAVARD, G</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><jtitle>Mathematical programming</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>AUDET, C</au><au>HANSEN, P</au><au>JAUMARD, B</au><au>SAVARD, G</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A branch and cut algorithm for nonconvex quadratically constrained quadratic programming</atitle><jtitle>Mathematical programming</jtitle><date>2000</date><risdate>2000</risdate><volume>87</volume><issue>1</issue><spage>131</spage><epage>152</epage><pages>131-152</pages><issn>0025-5610</issn><eissn>1436-4646</eissn><coden>MHPGA4</coden><cop>Heidelberg</cop><pub>Springer</pub><doi>10.1007/s101079900106</doi><tpages>22</tpages><oa>free_for_read</oa></addata></record>
fulltext	fulltext
identifier	ISSN: 0025-5610
ispartof	Mathematical programming, 2000, Vol.87 (1), p.131-152
issn	0025-5610 1436-4646
language	eng
recordid	cdi_crossref_primary_10_1007_s101079900106
source	Business Source Ultimate; Springer Nature
subjects	Applied sciences Exact sciences and technology Mathematical programming Operational research and scientific management Operational research. Management science
title	A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
url	http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T03%3A40%3A56IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20branch%20and%20cut%20algorithm%20for%20nonconvex%20quadratically%20constrained%20quadratic%20programming&rft.jtitle=Mathematical%20programming&rft.au=AUDET,%20C&rft.date=2000&rft.volume=87&rft.issue=1&rft.spage=131&rft.epage=152&rft.pages=131-152&rft.issn=0025-5610&rft.eissn=1436-4646&rft.coden=MHPGA4&rft_id=info:doi/10.1007/s101079900106&rft_dat=%3Cpascalfrancis_cross%3E1262591%3C/pascalfrancis_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c369t-1321d975af9d066944c1b2fba228fa8498ec8e21d4c61b3f7f7bf1bfcd1046e33%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true