An application of shortest path algorithm: optimal assortments for network goods with vertical differentiation
This paper presents an efficient algorithm based on the shortest path algorithm for a directed weighted graph where all arc cots depend on which node is thought of as the source node. This approach can be applied well to the optimal assortment problem for a network good industry with vertical differ...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
EDP Sciences
2017-01-01
|
| Series: | MATEC Web of Conferences |
| Online Access: | https://doi.org/10.1051/matecconf/201713900065 |