Bicriteria path problem minimizing the cost and minimizing the number of labels
We address a bicriterion path problem where each arc is assigned with a cost value and a label (such as a color). The first criterion intends to minimize the total cost of the path (the summation of its arc costs), while the second intends to get the solution with a minimal number of different label...
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | article |
| Language: | eng |
| Published: |
2013
|
| Online Access: | http://hdl.handle.net/10316/44383 |
| Country: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/44383 |