Efficient primal-dual heuristic for a dynamic location problem
In this paper the dynamic location problem with opening, closure and reopening of facilities is formulated and an efficient primal-dual heuristic that computes both upper and lower limits to its optimal solution is described. The problem here studied considers the possibility of reconfiguring any lo...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2007
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10316/5490 |
| País: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/5490 |