Search the dblp DataBase
Anders J. V. Skriver: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Anders J. V. Skriver, Kim Allan Andersen
A label correcting approach for solving bicriterion shortest-path problems. [Citation Graph (0, 0)][DBLP]
Computers & OR, 2000, v:27, n:6, pp:507-524 [Journal] - Morten Riis, Anders J. V. Skriver, Jørn Lodahl
Deployment of Mobile Switching Centers in a Telecommunications Network: A Stochastic Programming Approach. [Citation Graph (0, 0)][DBLP]
Telecommunication Systems, 2004, v:26, n:1, pp:93-109 [Journal] - Anders J. V. Skriver, Kim Allan Andersen, Kaj Holmberg
Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives. [Citation Graph (0, 0)][DBLP]
European Journal of Operational Research, 2004, v:156, n:3, pp:541-549 [Journal] - Anders J. V. Skriver, Kim Allan Andersen
The bicriterion semi-obnoxious location (BSL) problem solved by an epsilon-approximation. [Citation Graph (0, 0)][DBLP]
European Journal of Operational Research, 2003, v:146, n:3, pp:517-528 [Journal] - Matthias Ehrgott, Anders J. V. Skriver
Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach. [Citation Graph (0, 0)][DBLP]
European Journal of Operational Research, 2003, v:147, n:3, pp:657-664 [Journal]
Search in 0.002secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002