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
A branch-and-cut method for 0-1 mixed convex programming
Home
Publications
A branch-and-cut method for 0-1 mixed convex programming
A branch-and-cut method for 0-1 mixed convex programming
Authors:
RS
Robert A. Stubbs
Robert A. Stubbs
SM
Sanjay Mehrotra
Sanjay Mehrotra
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Publisher website
Google Scholar
1 December 1999
journal article
Published by
Springer Nature
in
Mathematical Programming
Vol. 86
(3)
,
515-532
DOI:
10.1007/s101070050103
Abstract
No abstract available
Keywords
BRANCH AND CUT
CONVEX PROGRAMMING
Cited
Cited by 273 articles
Scroll to top