Zobrazeno 1 - 10
of 16
pro vyhledávání: '"E. J. Beltrami"'
Autor:
G. Arienti, A. Colonelli Daneri, M. Auslender, E. J. Beltrami, L. F. Buchanan, A. R. Stubberud, Philippe A. Clavier, R. Cosaert, E. Gottzein, A. De Maio, G. Guardabassi, A. Locatelli, S. Rinaldi, Mark Enns, H. O. Fattorini, Jean Fave, F. Caroti Ghelli, D. H. Jacobson, S. Kau, K. S. P. Kumar, Henry J. Kelley, Walter F. Denham, Angelo Miele, Radivoj Petrovi?, J. K. Skwirzynski, R. G. Stefanek, P. V. Kokotovi?, L. E. Weaver, D. G. Schultz
Autor:
E. J. Beltrami, Lawrence D. Bodin
Publikováno v:
Networks. 4:65-94
Vehicle routing for municipal waste collection encompasses a variety of problems. In this paper, we explore the techniques we have developed for solving some of these problems.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::22425d8dab617b537c2f670a1ba480d5
https://doi.org/10.1002/net.3230040106
https://doi.org/10.1002/net.3230040106
Autor:
E. J. Beltrami
Publikováno v:
Journal of Optimization Theory and Applications. 45:477-480
Implementation of the penalty function method for constrained optimization poses numerical difficulties as the penalty parameter increases. To offset this problem, one often resorts to Newton's method. In this note, working in the context of the pena
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b5a96af349ffe105de2ff6b00796aed9
https://doi.org/10.1007/bf00938447
https://doi.org/10.1007/bf00938447
Autor:
E. J. Beltrami
Publikováno v:
SIAM Journal on Applied Mathematics. 16:1096-1100
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a58eb83c5acdbc03f928cf4137985bc7
https://doi.org/10.1137/0116089
https://doi.org/10.1137/0116089
Autor:
E. J. Beltrami, J. P. Indusi
Publikováno v:
IEEE Transactions on Computers. :1004-1008
The well-known pattern search method has been randomized by Lawrence and Steiglitz [4] in order to augment its ability to adapt to direction. In this note we introduce other refinements in order to make it more adaptive in step size, and the use of p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc77cdf0f4bc8ee35ef5e851f48d7c04
https://doi.org/10.1109/tc.1972.5009077
https://doi.org/10.1109/tc.1972.5009077
Autor:
M. R. Wohlers, E. J. Beltrami
Publikováno v:
Bull. Amer. Math. Soc. 71, no. 5 (1965), 753-755
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::49375d5d5968985d2a92f73103732829
https://doi.org/10.1090/s0002-9904-1965-11376-3
https://doi.org/10.1090/s0002-9904-1965-11376-3
Autor:
M. R. Wohlers, E. J. Beltrami
Publikováno v:
Archive for Rational Mechanics and Analysis. 18:304-309
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6cbf4ced545848542c749e5616935ca1
https://doi.org/10.1007/bf00251669
https://doi.org/10.1007/bf00251669
Autor:
M. R. Wohlers, E. J. Beltrami
Publikováno v:
SIAM Journal on Applied Mathematics. 15:1077-1087
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a0c5f6114febe73f970672b040923ea
https://doi.org/10.1137/0115092
https://doi.org/10.1137/0115092
Autor:
E. J. Beltrami, R. McGill
Publikováno v:
Operations Research. 14:267-278
In this paper we consider certain nonlinear and constrained variational problems that occur in the theory of search. The problems are definitely of a nonclassical variety, but, by using a device of R. Courant, a sequence of unconstrained variational
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::86db2f7b51716e08712029a2710ad77c
https://doi.org/10.1287/opre.14.2.267
https://doi.org/10.1287/opre.14.2.267
Autor:
E. J. Beltrami
Publikováno v:
SIAM Journal on Applied Mathematics. 15:1011-1017
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e971308bc62d001ee4a3ac683108576e
https://doi.org/10.1137/0115087
https://doi.org/10.1137/0115087