Search Results - "polynomial-time dynamic programming algorithms"
-
1
Authors: et al.
Contributors: et al.
Source: Annals of Operations Research. 69:1-31
Subject Terms: polynomial-time dynamic programming algorithms, Deterministic scheduling theory in operations research, flow shop scheduling, dynamic programming, makespan, sequencing, assigning, Abstract computational complexity for mathematical programming problems, flow line, precedence constraints
File Description: application/xml; STAMPA
Access URL: https://econpapers.repec.org/article/sprannopr/v_3a69_3ay_3a1997_3ai_3a0_3ap_3a1-31_3a10.1023_2fa_3a1018916608787.htm
https://usiena-air.unisi.it/handle/11365/29446
https://link.springer.com/article/10.1023/A:1018916608787
https://dblp.uni-trier.de/db/journals/anor/anor69.html#AgnetisA97
https://ideas.repec.org/a/spr/annopr/v69y1997i0p1-3110.1023-a1018916608787.html
https://hdl.handle.net/11697/23406
https://doi.org/10.1023/A:1018916608787
http://link.springer.com/article/10.1023/A:1018916608787
Full Text Finder
Nájsť tento článok vo Web of Science