Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Sverre Storøy"'
Autor:
Sjur D. Flåm, Sverre Storøy
Publikováno v:
Modeling, Identification and Control, Vol 7, Iss 2, Pp 83-92 (1986)
This paper is concerned with the allocation of exploratory efforts under the limitation of a fixed budget. A chance constrained problem is formulated. To solve this problem an algorithm is developed which is based on the entropic penalty approach rec
Externí odkaz:
https://doaj.org/article/d8f6ea40a1bb4272921b8ffb275f601b
Autor:
Sverre Storøy, Dag Haugland
Publikováno v:
Optimization and Engineering. 7:81-96
We consider the problem of finding a linear combination of at most t out of K column vectors in a matrix, such that a target vector is approximated as closely as possible. The motivation of the model is to find a lower-dimensional representation of a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5b7adbd71af904cf2f235c902c73b758
https://doi.org/10.1007/s11081-006-6592-3
https://doi.org/10.1007/s11081-006-6592-3
During the last three decades, breakthroughs in computer technology have made a tremendous impact on optimization. In particular, parallel computing has made it possible to solve larger and computationally more difficult prob lems. This volume cont
Autor:
Sverre Storøy, Tor Sørevik
Publikováno v:
Computing. 59:1-16
In this paper we describe how to apply fine grain parallelism to augmenting path algorithms for the dense linear assignment problem. We prove by doing that the technique we suggest, can be efficiently implemented on commercial available, massively pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62088c8843da5b0f584c5bfd803dfe95
https://doi.org/10.1007/bf02684400
https://doi.org/10.1007/bf02684400
Publikováno v:
Computational Optimization and Applications. 6:251-272
The purpose of this study is to describe a data parallel primal-dual augmenting path algorithm for the dense linear many-to-one assignment problem also known as semi-assignment. This problem could for instance be described as assigning n persons to m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f7d3c0d504e4fedd9243a0019e49055
https://doi.org/10.1007/bf00247794
https://doi.org/10.1007/bf00247794
Publikováno v:
International Transactions in Operational Research. 1:305-316
The Pivot and Complement heuriitic is a procedure that frequently finds feasible solutions for general 0–1 integer programs. We present a refinement of the heuristic based on Tabu Search techniques. Local search strategies for the search phase, as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0d320eea57d74c8008dd252e9482f2ef
https://doi.org/10.1016/0969-6016(94)90031-0
https://doi.org/10.1016/0969-6016(94)90031-0
Autor:
Sverre Storøy
Publikováno v:
European Journal of Operational Research. 73:510-516
In the present paper we study how the weights used in column aggregation of linear programs may be changed in order to improve the objective value. A procedure similar to postoptimal change of the coefficients of a basic variable is developed.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a5276ff14fd3052bd5edbd4f17001576
https://doi.org/10.1016/0377-2217(94)90246-1
https://doi.org/10.1016/0377-2217(94)90246-1
Autor:
Sverre Storøy
Publikováno v:
Operations Research Letters. 19:29-31
It is well known that for any partitioning of the variables of a linear program, optimal aggregation weights exist. In the present paper we show that if two or more of the optimal basic variables of the original problem are aggregated into the same v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ac7d11441b9cf2a6b9907f49495ca9b
https://doi.org/10.1016/0167-6377(96)00009-0
https://doi.org/10.1016/0167-6377(96)00009-0
A convergent iterative aggregation procedure is described. The procedure makes use of both weight updating and reclustering of variables during the iterative process. Scope and purpose During the last two decades, aggregation/disaggregation has becom
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::21d2af9e41484192f5584ed6c8336bac
Publikováno v:
Applied Optimization ISBN: 9781461334026
In this chapter we review parallel algorithms for some linear network problems, with special emphasis on the bipartite assignment problem. The many-to-one assignment problem is considered, and a breadth-first-search algorithm for finding augmenting p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a7a62220f13ff05199b6687c5360072f
https://doi.org/10.1007/978-1-4613-3400-2_6
https://doi.org/10.1007/978-1-4613-3400-2_6