"When Does a Dynamic Programming Formulation Guarantee the Existence of a ..."

Gerhard J. Woeginger (2000)

> Home

Details and statistics

DOI: 10.1287/IJOC.12.1.57.11901

access: closed

type: Journal Article

metadata version: 2020-03-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/informs/Woeginger00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/informs/Woeginger00
Gerhard J. Woeginger:
When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? INFORMS J. Comput. 12(1): 57-74 (2000)

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.