Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Concavity cuts for disjoint bilinear programming
Home
Publications
Concavity cuts for disjoint bilinear programming
Concavity cuts for disjoint bilinear programming
Authors:
SA
Stéphane Alarie
Stéphane Alarie
CA
Charles Audet
Charles Audet
BJ
Brigitte Jaumard
Brigitte Jaumard
GS
Gilles Savard
Gilles Savard
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Publisher website
Google Scholar
1 April 2001
journal article
research article
Published by
Springer Nature
in
Mathematical Programming
Vol. 90
(2)
,
373-398
DOI:
10.1007/pl00011428
Abstract
No abstract available
Keywords
KEY WORDS: CONCAVITY CUTS DISJOINT BILINEAR PROGRAMMING LINEAR MAXMIN PROGRAMMING BRANCH AND BOUND ALGORITHM GLOBAL OPTIMIZATION
Cited
Cited by 33 articles
Scroll to top