Generating k-best solutions to auction winner determination problems
ACM SIGecom Exchanges
Finding the K shortest hyperpaths
Computers and Operations Research
Computing all efficient solutions of the biobjective minimum spanning tree problem
Computers and Operations Research
Efficiently Generating k-Best Solutions to Procurement Auctions
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
An Efficient Algorithm for the Shortest Path Problem with Forbidden Paths
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Finding skyline paths in road networks
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
International Journal of Applied Mathematics and Computer Science
A bi-criteria approach for Steiner's tree problems in communication networks
Proceedings of the 2011 International Workshop on Modeling, Analysis, and Control of Complex Networks
A bi-criteria algorithm for multipoint-to-multipoint virtual connections in transport networks
Proceedings of the 7th International Conference on Network and Services Management
A Reference Point Approach for the Resource Constrained Shortest Path Problems
Transportation Science
| Hi-index | 0.01 |