Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Richard V. Helgason"'
Autor:
Ronald D. Dearing, Richard V. Helgason
Publikováno v:
The Engineering Economist. 55:38-51
Project balances are shown to be the coefficients resulting from division of the future worth polynomial by a simple monomial and are used in representations of the future worth polynomial and its derivative. Those representations are used to provide
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0c2437a59933cde3ad75bac1c56e0c67
https://doi.org/10.1080/00137910903555965
https://doi.org/10.1080/00137910903555965
Publikováno v:
Journal of Heuristics. 7:473-494
This manuscript presents a heuristic algorithm based on geometric concepts for the problem of finding a path composed of line segments from a given origin to a given destination in the presence of polygonal obstacles. The basic idea involves construc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da4cadafcfabcca68db4437c02aba25f
https://doi.org/10.1023/a:1011325912346
https://doi.org/10.1023/a:1011325912346
Publikováno v:
INFORMS Journal on Computing. 10:323-330
We present an algorithm for identifying the extreme rays of the conical hull of a finite set of vectors whose generated cone is pointed. This problem appears in diverse areas including stochastic programming, computational geometry, and non-parametri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c1dc44bad989d7b315fc645b4c6e2252
https://doi.org/10.1287/ijoc.10.3.323
https://doi.org/10.1287/ijoc.10.3.323
Autor:
Richard V. Helgason, José H. Dulá
Publikováno v:
European Journal of Operational Research. 92:352-367
Consider a set, A of n points in m-dimensional space. The convex hull of these points is a polytope, P , in R m . The frame, F , of these points in the set of extreme points of teh polytope P with F ⊆ A . The problem of identifying the frame plays
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::618ba421821d7c6bf8f7513187952d03
https://doi.org/10.1016/0377-2217(94)00366-1
https://doi.org/10.1016/0377-2217(94)00366-1
Publikováno v:
Optimization Methods and Software. 4:191-207
Minimum cost network flow problems with a piecewise linear convex cost function are used to model various optimization problems. They are also used extensively to approximate nonlinear cost functions which may otherwise be difficult to handle. Solvin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a00dbdab0f21dae109983a5ce9efae94
https://doi.org/10.1080/10556789408805587
https://doi.org/10.1080/10556789408805587
Publikováno v:
Computational Optimization and Applications. 2:47-75
Four new shortest-path algorithms, two sequential and two parallel, for the source-to-sink shortest-path problem are presented and empirically compared with five algorithms previously discussed in the literature. The new algorithm, S22, combines the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd6c72283f4ac5444ee2eb01d88bd3be
https://doi.org/10.1007/bf01299142
https://doi.org/10.1007/bf01299142
Publikováno v:
Handbook of Optimization in Telecommunications ISBN: 9780387306629
Handbook of Optimization in Telecommunications
Handbook of Optimization in Telecommunications
The minimal cost network flow model is defined along with optimality criteria and three efficient procedures for obtaining an optimal solution. Primal and dual network simplex methods are specializations of well-known algorithms for linear programs.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e111b14e39079da45d531850b4dadd4d
https://doi.org/10.1007/978-0-387-30165-5_6
https://doi.org/10.1007/978-0-387-30165-5_6
Publikováno v:
Operations Research/Computer Science Interfaces Series ISBN: 9781461368373
Interfaces in Computer Science and Operations Research
Interfaces in Computer Science and Operations Research
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce9341dc2fad9df9e86a57ed8e52949d
https://doi.org/10.1007/978-1-4615-4102-8
https://doi.org/10.1007/978-1-4615-4102-8
Publisher Summary This chapter discusses primal simplex algorithms for minimum cost network flows. Due to the special structure of bases for the linear network flow model, specialized simplex-based software can solve these problems in from one to two
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0534dc5ec48fdeb723e7667c4442b370
https://doi.org/10.1016/s0927-0507(05)80119-7
https://doi.org/10.1016/s0927-0507(05)80119-7
Publikováno v:
The Impact of Emerging Technologies on Computer Science and Operations Research ISBN: 9781461359340
The convex hull of a set A of n points in ℜm generates a polytope P. The frame F of A is the set of extreme points of P. The frame problem, the identification of F given A, is central to problems in operations research and computer science. In OR i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae0c3bff24928b6d0c9d05b1d26e9205
https://doi.org/10.1007/978-1-4615-2223-2_5
https://doi.org/10.1007/978-1-4615-2223-2_5