J. George Shanthikumar

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Dorit S. Hochbaum

> Home > Persons > J. George Shanthikumar

Publications

1992
[j31]
- view
  authority control:
- export record
  dblp key:
  - journals/mp/HochbaumSS92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/HochbaumSS92
Dorit S. Hochbaum, Ron Shamir, J. George Shanthikumar:
A polynomial algorithm for an integer quadratic non-separable transportation problem. Math. Program. 55: 359-371 (1992)
1990
[j25]
- view
  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)
1989
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/HochbaumS89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/HochbaumS89
Dorit S. Hochbaum, J. George Shanthikumar:
The Complexity of Nonlinear Separable Optimization. ICALP 1989: 461-472

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.