"A branch-and-cut method for 0-1 mixed convex programming."

Robert A. Stubbs, Sanjay Mehrotra (1999)

> Home

Details and statistics

DOI: 10.1007/S101070050103

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/StubbsM99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/StubbsM99
Robert A. Stubbs, Sanjay Mehrotra:
A branch-and-cut method for 0-1 mixed convex programming. Math. Program. 86(3): 515-532 (1999)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.