Kasperski, Adam, Zieliński, Paweł (2009) On the approximability of minmax (regret) network optimization problems. Information Processing Letters, 109 (5) 262-266 doi:10.1016/j.ipl.2008.10.008
Reference Type | Journal (article/letter/editorial) | ||
---|---|---|---|
Title | On the approximability of minmax (regret) network optimization problems | ||
Journal | Information Processing Letters | ||
Authors | Kasperski, Adam | Author | |
Zieliński, Paweł | Author | ||
Year | 2009 (February) | Volume | 109 |
Page(s) | 262-266 | Issue | 5 |
Publisher | Elsevier BV | ||
DOI | doi:10.1016/j.ipl.2008.10.008Search in ResearchGate | ||
Mindat Ref. ID | 14605269 | Long-form Identifier | mindat:1:5:14605269:1 |
GUID | e5a4edf6-3f01-41f9-abcc-17fe2fd71dd6 | ||
Full Reference | Kasperski, Adam, Zieliński, Paweł (2009) On the approximability of minmax (regret) network optimization problems. Information Processing Letters, 109 (5) 262-266 doi:10.1016/j.ipl.2008.10.008 | ||
Plain Text | Kasperski, Adam, Zieliński, Paweł (2009) On the approximability of minmax (regret) network optimization problems. Information Processing Letters, 109 (5) 262-266 doi:10.1016/j.ipl.2008.10.008 | ||
In | (2009, February) Information Processing Letters Vol. 109 (5) Elsevier BV |
References Listed
These are the references the publisher has listed as being connected to the article. Please check the article itself for the full list of references which may differ. Not all references are currently linkable within the Digital Library.
Ahuja (1993) | |
Aissi (2005) Complexity of the min-max (regret) versions of cut problems vol. 3827, 789 | |
Aissi (2005) Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack vol. 3669, 862 | |
Aissi (2006) Approximating min-max (regret) versions of some polynomial problems vol. 4112, 428 | |
Not Yet Imported: European Journal of Operational Research - journal-article : 10.1016/j.ejor.2006.03.023 If you would like this item imported into the Digital Library, please contact us quoting Journal ID 22428 | |
Not Yet Imported: Operations Research Letters - journal-article : 10.1016/j.orl.2004.12.002 If you would like this item imported into the Digital Library, please contact us quoting Journal ID 61237 | |
Not Yet Imported: Operations Research Letters - journal-article : 10.1016/S0167-6377(03)00058-0 If you would like this item imported into the Digital Library, please contact us quoting Journal ID 61237 | |
Not Yet Imported: Discrete Applied Mathematics - journal-article : 10.1016/S0166-218X(03)00462-1 If you would like this item imported into the Digital Library, please contact us quoting Journal ID 18210 | |
Not Yet Imported: European Journal of Operational Research - journal-article : 10.1016/j.ejor.2003.07.007 If you would like this item imported into the Digital Library, please contact us quoting Journal ID 22428 | |
Garey (1979) | |
Not Yet Imported: Operations Research Letters - journal-article : 10.1016/j.orl.2006.09.007 If you would like this item imported into the Digital Library, please contact us quoting Journal ID 61237 | |
Not Yet Imported: Nonconvex Optimization and Its Applications - book : 10.1007/978-1-4757-2620-6 If you would like this item imported into the Digital Library, please contact us quoting Book ID 9781441947642 | |
Lawler (1976) | |
Not Yet Imported: European Journal of Operational Research - journal-article : 10.1016/S0377-2217(03)00373-4 If you would like this item imported into the Digital Library, please contact us quoting Journal ID 22428 |
See Also
These are possibly similar items as determined by title/reference text matching only.