A branch-and-cut algorithm for a multi-item inventory distribution problem
This paper considers a multi-item inventory distribution problem motivated by a practical case occurring in the logistic operations of an hospital. There, a single warehouse supplies several nursing wards. The goal is to define a weekly distribution plan of medical products that minimizes the visits...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | bookPart |
| Idioma: | eng |
| Publicado em: |
2017
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10773/16677 |
| País: | Portugal |
| Oai: | oai:ria.ua.pt:10773/16677 |