Zobrazeno 1 - 6
of 6
pro vyhledávání: '"R S, Garfinkel"'
Autor:
W. J. Plotnicki, R. S. Garfinkel
Publikováno v:
Operations Research. 38:629-633
Fixed Cycle Scheduling (FCS) is a class of job scheduling problems in which all scheduling decisions (assignment of tasks to processors) are made on a cycle. That is, if task t is assigned to processor j at period h < n, then the same assignment is m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a33bef8c7d340603f4469b405c456cec
https://doi.org/10.1287/opre.38.4.629
https://doi.org/10.1287/opre.38.4.629
Publikováno v:
The Journal of clinical psychiatry. 55(10)
About one third of patients with bulimia nervosa continue to do poorly despite intensive treatment. In an effort to identify historical factors that might differentiate patients who are persistently bulimic from patients who have fully recovered, we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmid________::450364a90604f24521c50d101fa8a4a8
https://pubmed.ncbi.nlm.nih.gov/7961518
https://pubmed.ncbi.nlm.nih.gov/7961518
Publikováno v:
Anxiety. 1(5)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmid________::9cf8097758bce01c36901a788351e04e
https://pubmed.ncbi.nlm.nih.gov/9160579
https://pubmed.ncbi.nlm.nih.gov/9160579
Autor:
K. C. Gilbert, R. S. Garfinkel
Publikováno v:
Journal of the ACM. 25:435-448
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::18fe8b6469d8f0dae1211630b81ba524
https://doi.org/10.1145/322077.322086
https://doi.org/10.1145/322077.322086
Autor:
R. S. Garfinkel, P. S. Sundararaghavan
Publikováno v:
SIAM Journal on Algebraic Discrete Methods. 5:463-466
For a directed graph $G = (N,A)$, the kth stripe of G is $R_k = \{ (i,[i + k]_n )\} $ where $[a]_n $ is a (modulo n) and n is the number of nodes. A graph is striped if A consists of a set of stripes. The t-stripe problem is to determine whether a gr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2f9a287db851a6ebdf3e5a46b28ce7ca
https://doi.org/10.1137/0605045
https://doi.org/10.1137/0605045
Autor:
R. S. Garfinkel, George L. Nemhauser
Publikováno v:
Operations Research. 17:848-856
This paper gives an enumerative algorithm for the set-partitioning problem, that is, the set-covering problem with equality constraints, and presents computational results for real and randomly generated problems. The fact that many problems can be s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e38ad92f062546f643e882c34ac24c23
https://doi.org/10.1287/opre.17.5.848
https://doi.org/10.1287/opre.17.5.848