Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A polynomial time repeated cuts algorithm for the time cost tradeoff ..."

Dorit S. Hochbaum (2016)

> Home

Details and statistics

DOI: 10.1016/J.CIE.2016.02.018

access: closed

type: Journal Article

metadata version: 2020-02-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/candie/Hochbaum16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/candie/Hochbaum16
Dorit S. Hochbaum:
A polynomial time repeated cuts algorithm for the time cost tradeoff problem: The linear and convex crashing cost deadline problem. Comput. Ind. Eng. 95: 64-71 (2016)

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.