Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Konstantinos Paparrizos"'
Publikováno v:
Annals of Operations Research. 229:607-633
Two decades of research led to the development of a number of efficient algorithms that can be classified as exterior point simplex-type. This type of algorithms can cross over the infeasible region of the primal (dual) problem and find an optimal so
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d7674dedc8ddca96241889601cc0025c
https://doi.org/10.1007/s10479-014-1769-1
https://doi.org/10.1007/s10479-014-1769-1
Publikováno v:
Optimization. 62:1003-1006
We are presenting in this special issue selected, peer-reviewed, papers that were presented at the 1st International Symposium and 10th Balkan Conference on Operational Research (BALCOR 2011), which was held during September 22-24, 2011, in Thessalon
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc38489084dd4b99f43835ea90f006dd
https://doi.org/10.1080/02331934.2013.817072
https://doi.org/10.1080/02331934.2013.817072
Publikováno v:
RAIRO - Operations Research. 46:211-234
The minimum cost network flow problem, (MCNFP) con- stitutes a wide category of network flow problems. Recently a new dual network exterior point simplex algorithm (DNEPSA) for the MCNFP has been developed. This algorithm belongs to a special "exteri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::259d92c9eba57e86c3a373bc1f1958e8
https://doi.org/10.1051/ro/2012015
https://doi.org/10.1051/ro/2012015
Publikováno v:
International Journal of Computer Mathematics. 87:1831-1846
In this paper, we present a theoretical investigation and an extensive computational study of exterior point simplex algorithm (EPSA) initialization methods for the assignment problem (AP). We describe the exterior point algorithm using three differe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::10173f3ccc444072ddfe8227c6470b6d
https://doi.org/10.1080/00207160802524739
https://doi.org/10.1080/00207160802524739
Publikováno v:
INFORMS Transactions on Education. 10:34-40
Operations Research (OR) instructors use visualizations to help teach graph algorithms and data structures. Algorithm visualization is an illustration of abstract concepts included in computer algorithms, making use of either static or dynamic (anima
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1655a4c1c1749c230ed67a03be35d973
https://doi.org/10.1287/ited.1090.0026
https://doi.org/10.1287/ited.1090.0026
Publikováno v:
Computers & Operations Research. 36:1176-1190
In this paper a new Network Exterior Point Simplex Algorithm (NEPSA) for the Minimum Cost Network Flow Problem (MCNFP) is analytically presented. NEPSA belongs to a special simplex type category and is a modification of the classical network simplex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f6943caaa7ccbe9a803824eb3805cf5
https://doi.org/10.1016/j.cor.2008.01.001
https://doi.org/10.1016/j.cor.2008.01.001
Publikováno v:
Yugoslav Journal of Operations Research, Vol 18, Iss 1, Pp 75-94 (2008)
This paper presents a generalized method for management decision making incorporating risk assessment techniques. The risk based decision making methodology is applied to European Union expenditure programs used to implement its regional policy, such
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4b680e1507b95af413b0c7b83ff80496
http://www.doiserbia.nb.rs/img/doi/0354-0243/2008/0354-02430801075M.pdf
http://www.doiserbia.nb.rs/img/doi/0354-0243/2008/0354-02430801075M.pdf
Publikováno v:
Operational Research. 7:449-463
The Minimum Cost Network Flow Problem (MCNFP) constitutes perhaps the most important of the research area of Network Optimization. Recently a new category of algorithms for the MCNFP have been developed. These algorithms belong to a special “exteri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33ea00aa528df5060321ccfaade3db37
https://doi.org/10.1007/bf03024857
https://doi.org/10.1007/bf03024857
Publikováno v:
Computer Applications in Engineering Education. 15:1-14
Visual LinProg is an educational tool that solves linear problems (LPs), using animation and visualization techniques. The core of the proposed software includes the well-known class of simplex type algorithms. This tool is a Web-based software and h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e7f1ca88a80b0c3a9eb0689c69907a6
https://doi.org/10.1002/cae.20084
https://doi.org/10.1002/cae.20084
Publikováno v:
International Journal of Mathematical Education in Science and Technology. 37:765-782
This paper presents new web-based educational software (webNetPro) for Linear Network Programming. It includes many algorithms for Network Optimization problems, such as shortest path problems, minimum spanning tree problems, maximum flow problems an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee822a675f09b57ebf775a943a0cc432
https://doi.org/10.1080/00207390600723551
https://doi.org/10.1080/00207390600723551