Zobrazeno 1 - 4
of 4
pro vyhledávání: '"H. S. Lall"'
Publikováno v:
Operations Research. 28:995-1000
This note presents our computational experience using specialized techniques for solving multicommodity network flow problems. The algorithms investigated include a price-directive decomposition procedure, a resource-directive decomposition procedure
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::074b7d23a230b247766498d22866b51c
https://doi.org/10.1287/opre.28.4.995
https://doi.org/10.1287/opre.28.4.995
Publikováno v:
Networks. 8:315-339
In recent years there have been several extremely successful specialization of the primal simplex method for solving network flow problems. Much of this success is due to the development of highly efficient computational techniques for implementing t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c302be41d4df83a6aa33642cb59200c7
https://doi.org/10.1002/net.3230080405
https://doi.org/10.1002/net.3230080405
Publikováno v:
Mathematical Programming. 18:338-343
This paper presents a characterization of the solutions of a singly constrained quadratic program. This characterization is then used in the development of a polynomially bounded algorithm for this class of problems.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::13f990a6a4639af844b6033f7e039c95
https://doi.org/10.1007/bf01588328
https://doi.org/10.1007/bf01588328
This paper presents a characterization of the solutions of a special quadratic program. This characterization is then used in the development of an efficient algorithm for this class of problems.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a486a5824c78e05b412f72761f2574ce
https://doi.org/10.21236/ada052370
https://doi.org/10.21236/ada052370
