Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Harold Greenberg"'
Autor:
Harold Greenberg, Leonard S. Sarko
Summary Inorganic Recycling Corporation has developed a process which chemically fixates inorganic hazardous waste in order to manufacture inert, nonleachable ceramic products. All materials exiting this System are usable. None are placed in a landfi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::21aeaf9b5dfff0a416bae35a4476047c
https://doi.org/10.1016/s0166-1116(08)70444-8
https://doi.org/10.1016/s0166-1116(08)70444-8
Autor:
Harold Greenberg
Publikováno v:
Journal of Algorithms. 9:343-353
We solve the 3-variable problem: find integers x ≥ 0, y ≥ 0, z ≥ 0 that satisfy ax + by + cz = L for given integers a, b, c, L, where 1 < a < b < c < L. The method of solution is related to the one for the Frobenius problem in three variables,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad2e5f7f75d63f72c26f72c6abdfc626
https://doi.org/10.1016/0196-6774(88)90025-9
https://doi.org/10.1016/0196-6774(88)90025-9
Autor:
Israel Feldman, Harold Greenberg
Publikováno v:
Discrete Applied Mathematics. 2(1):21-25
The knapsack problem, maximize Σmi = 1 cixi when Σmi = 1 aixi⩽b for integers xi⩾0, can be solved by the classical step-off algorithm. The algorithm develops a series of feasible solutions with ever-increasing objective values. We make a change
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0b2a31af34434a007a1e78ef00113e2d
Autor:
Harold Greenberg
Publikováno v:
Journal of Mathematical Analysis and Applications. 111:327-331
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d5d305773f7beb45dc89e0f07cecdc67
https://doi.org/10.1016/0022-247x(85)90219-7
https://doi.org/10.1016/0022-247x(85)90219-7
Autor:
Harold Greenberg
Publikováno v:
Numerische Mathematik. 24:19-26
Given a system of linear inequalities that define a polyhedral cone, we develop a simple technique for finding redundant inequalities. We thus insure that only the cone's extreme rays are calculated. The general solution for the system is developed i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb4637aa86dceb3f2e930aa5e851c76c
https://doi.org/10.1007/bf01437214
https://doi.org/10.1007/bf01437214
Autor:
Harold Greenberg
Publikováno v:
Numerische Mathematik. 34:349-352
We solve the diophantine equation $$\sum\limits_{j = 1}^n {a_j x_j } = L$$ for nonnegative variablesx j , wherea j andL are positive integers. We characterize both the values ofL that lead to solutions and those that do not lead to solutions. We solv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::93a5a12dc82c5a2581d7044815d0982e
https://doi.org/10.1007/bf01403673
https://doi.org/10.1007/bf01403673
Autor:
Harold Greenberg, Arthur Daou
Publikováno v:
Operations Research. 8:524-532
An operational study of tunnel-traffic flow is presented. A bottleneck within the tunnel is shown to cause shock waves which travel backward in the stream and continue to the entrance of the tunnel. Flow and density data at the bottleneck is fitted t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f68cb5557c9d308c175dce780fa7931
https://doi.org/10.1287/opre.8.4.524
https://doi.org/10.1287/opre.8.4.524
Autor:
Harold Greenberg
Publikováno v:
Operations Research. 16:353-361
A mixed integer formulation is presented for the general n job, m machine scheduling problem. This formulation is shown to reduce to a series of noninteger L.P. problems of moderate proportions when applying the branch-bound technique. Solutions are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1dc945e3bcc36747d3c51b47986a3430
https://doi.org/10.1287/opre.16.2.353
https://doi.org/10.1287/opre.16.2.353
Autor:
Irwin Greenberg, Harold Greenberg
Publikováno v:
Operations Research. 14:137-144
A single-server queue with Poisson arrivals and exponential service is studied to obtain the joint probability distribution of the number in the system at time t and the cumulative number already served at time t. The probability that k are served in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f6e6e7a547dd259f42c08db7e09df7ec
https://doi.org/10.1287/opre.14.1.137
https://doi.org/10.1287/opre.14.1.137
Autor:
Harold Greenberg
Publikováno v:
Jewish Education. 37:113-121
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bf87f172227b374962b8799a2cb872bd
https://doi.org/10.1080/0021642670370303
https://doi.org/10.1080/0021642670370303