View Author
Spieksma, F.M.
( F.M. Spieksma)
solution problem network vertice level centre budget instance number vertex arc e approach fi xed cost accessibility algorithm section heuristic vertex j / european journal table result value search neighbourhood knapsack knapsack problem vns algorithm improvement constraint budget level order bc-mcfp group percentage study fi rst journal graph decision status duque research model parameter objective formulation procedure oscillation aaup /1/1/star neighbourhood search candidate planning knapsack problem-based heuristic european cplex strategy fi rst group multi-choice knapsack problem road network planning weight wj forest 458–465 demand accessibility arc np-hard aaup /p bene fit vns heuristic budget constraint weight supply budget values centre i performance aaup /1/1/tree fi xed example aaup instances q centres topology
2 Most Recent Publications
|
The accessibility arc upgrading problem
(Article)
Maya Duque, P.A. Coene, S. Goos, P.P. Sörensen, K. Spieksma, F.M. |
2013-02-01
|
|
On the relation between recurrence and ergodicity properties in denumerable Markov decision chains
(Article)
Dekker, R. Hordijk, A. Spieksma, F.M. |
1994-08-01
|
