Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Convex Separable Optimization Is Not Much Harder than Linear Optimization"

Dorit S. Hochbaum, J. George Shanthikumar (1990)

> Home

Details and statistics

DOI: 10.1145/96559.96597

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/HochbaumS90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/HochbaumS90
Dorit S. Hochbaum, J. George Shanthikumar:
Convex Separable Optimization Is Not Much Harder than Linear Optimization. J. ACM 37(4): 843-862 (1990)

a service of

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.