Zobrazeno 1 - 10
of 63
pro vyhledávání: '"Leon Cooper"'
Introduction to Dynamic Programming introduces the reader to dynamic programming and presents the underlying mathematical ideas and results, as well as the application of these ideas to various problem areas. A large number of solved practical proble
Autor:
Leon Cooper
Publikováno v:
Historia Mathematica. 37:11-27
Although much discussed, the original intent of Problem 10 of the Moscow Mathematical Papyrus continues to be an unresolved question. This essay proposes a possible solution to the issue by joining together aspects of two theories on the subject adva
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1eedeeb8425c01f8b18d2e9224fda3d8
https://doi.org/10.1016/j.hm.2009.05.001
https://doi.org/10.1016/j.hm.2009.05.001
Autor:
Leon Cooper, Brian Blais
Publikováno v:
Scholarpedia. 3:1570
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::53a94d25e58c1488c377ffecd61034d2
https://doi.org/10.4249/scholarpedia.1570
https://doi.org/10.4249/scholarpedia.1570
Autor:
Richard V. Helgason, Leon Cooper, Jeffery L. Kennington, Michael A. Collins, Larry J. LeBlanc
Publikováno v:
Management Science. 24(7):747-760
For more than forty years, approximate solutions for the classical pipe network analysis problem have been obtained by direct solution of the nonlinear stationary point conditions. We propose a revolutionary new approach involving optimization techni
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8f987d7745990b7d686774f91c541a2
Autor:
Leon Cooper, Larry J. LeBlanc
Publikováno v:
Naval Research Logistics Quarterly. 24:327-337
A class of convex programming problems with network type constraints is addressed and an algorithm for obtaining the optimal solution is described. The stochastic transportation problem (minimize shipping costs plus expected holding and shortage cost
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::32d862d2d334676a12e53347d97aa34d
https://doi.org/10.1002/nav.3800240211
https://doi.org/10.1002/nav.3800240211
Autor:
Mary W. Cooper, Leon Cooper
Publikováno v:
Naval Research Logistics Quarterly. 25:415-429
An exact method for solving all-integer linear-programming problems is presented. Dynamic-programming methodology is used to search efficiently candidate hyperplanes for the optimal feasible integer solution. The explosive storage requirements for hi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01421f849ce229a9f30a9ac5e2264c7a
https://doi.org/10.1002/nav.3800250305
https://doi.org/10.1002/nav.3800250305
Autor:
I. Norman Katz, Leon Cooper
Publikováno v:
SIAM Journal on Numerical Analysis. 11:683-692
A probabilistic extension of the classical Weber problem is studied. N destinations in the plane, $P_j ,j = 1, \cdots ,N$, are given as random variables with specified probability density functions, and the problem is to find the location of the poin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d492b44394dcffb3e3eb056fa4878374
https://doi.org/10.1137/0711055
https://doi.org/10.1137/0711055
Autor:
Leon Cooper, Jeff Kennington
Publikováno v:
Naval Research Logistics Quarterly. 26:447-461
This exposition presents two algorithms for linear programs which allow a value change in more than one nonbasic variable at each iteration. The computational formulae are developed and errors which have appeared in the literature are noted. One algo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5668ea7a50279be864c5d9f08a98afc4
https://doi.org/10.1002/nav.3800260308
https://doi.org/10.1002/nav.3800260308
Autor:
Leon Cooper
Publikováno v:
Computers & Mathematics with Applications. 4:265-275
A stochastic extension of the continuous transportation—location problem has been formulated and characterized mathematically. Both an exact method of solution for small problems and a heuristic algorithm for large scale problems has been developed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc470c02f76d7de24a950844c90a0eda
https://doi.org/10.1016/0898-1221(78)90038-x
https://doi.org/10.1016/0898-1221(78)90038-x
Autor:
Leon Cooper, I. Norman Katz
Publikováno v:
European Journal of Operational Research. 6:166-173
A constrained form of the Weber problem is formulated in which no path is permitted to enter a prespecified forbidden region R of the plane. Using the calculus of variations the shortest path between two points x , y ∉ R which does not intersect R
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ebbbdbafe804199c6326715178b10454
https://doi.org/10.1016/0377-2217(81)90203-4
https://doi.org/10.1016/0377-2217(81)90203-4