The SCEAS System
| |||||||

## Search the dblp DataBase
Kim Allan Andersen:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Kim Allan Andersen, Daniele Pretolani
**Easy Cases of Probabilistic Satisfiability.**[Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 2001, v:33, n:1, pp:69-91 [Journal] - Kim Allan Andersen, Kurt Jörnsten, Mikael Lind
**On bicriterion minimal spanning trees: An approximation.**[Citation Graph (0, 0)][DBLP] Computers & OR, 1996, v:23, n:12, pp:1171-1182 [Journal] - Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani
**Finding the**[Citation Graph (0, 0)][DBLP]*K*shortest hyperpaths. Computers & OR, 2005, v:32, n:, pp:1477-1497 [Journal] - Morten Riis, Kim Allan Andersen
**Multiperiod capacity expansion of a telecommunications connection with uncertain demand.**[Citation Graph (0, 0)][DBLP] Computers & OR, 2004, v:31, n:9, pp:1427-1436 [Journal] - 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, Kim Allan Andersen
**Capacitated Network Design with Uncertain Demand.**[Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 2002, v:14, n:3, pp:247-260 [Journal] - Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen
**Finding the**[Citation Graph (0, 0)][DBLP]*K*shortest hyperpaths using reoptimization. Oper. Res. Lett., 2006, v:34, n:2, pp:155-164 [Journal] - Morten Riis, Kim Allan Andersen
**Applying the minimax criterion in stochastic recourse programs.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:165, n:3, pp:569-584 [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] **Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search.**[Citation Graph (, )][DBLP]**An algorithm for ranking assignments using reoptimization.**[Citation Graph (, )][DBLP]**Erratum to "An algorithm for ranking assignments using reoptimization" [Computers & Operations Research 35 (2008) 3714-3726].**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |