Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Link opens in a new tab
Search content at Illinois Experts
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
The traveling purchaser problem with stochastic prices: Exact and approximate algorithms
Seungmo Kang
,
Yanfeng Ouyang
Civil and Environmental Engineering
Grainger College of Engineering
Industrial and Enterprise Systems Engineering
Institute for Sustainability, Energy, and Environment
National Center for Supercomputing Applications (NCSA)
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The traveling purchaser problem with stochastic prices: Exact and approximate algorithms'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Approximation Algorithms
100%
Exact Algorithm
100%
Stochastic Price
100%
Traveling Purchaser Problem
100%
Seller
66%
Numerical Results
33%
Dynamic Programming
33%
Probability Distribution
33%
Selling
33%
Spatially Distributed
33%
Large-scale Application
33%
Greedy Heuristic
33%
Fast Solution
33%
Minimum Total Cost
33%
Optimal Routing
33%
Commodity Prices
33%
Total Expected Cost
33%
Distributed Location
33%
Optimum Strategy
33%
Purchase Cost
33%
Total Travel Cost
33%
Purchasing Strategy
33%
Exact Solution Algorithm
33%
Algorithm-based
33%
Heuristic Algorithm
33%
Computational Performance
33%
Mathematics
Stochastics
100%
Approximates
100%
Probability Distribution
33%
Minimizes
33%
Total Cost
33%
Optimum Strategy
33%
Heuristic Algorithm
33%
Offered Price
33%
Dynamic Programming
33%