Greedy, randomized and approximate dynamic programming algorithms for facility location problems
Research Paper Series (national University of Singapore. Faculty of Business Administration); 1998-067
Saved in:
Main Authors: | Bertsimas, Dimitris, Teo, Chung-Piaw, Vohra, Rakesh |
---|---|
Other Authors: | DECISION SCIENCES |
Format: | Working Paper/Technical Report |
Published: |
2018
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/140255 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
A multicut outer-approximation approach for competitive facility location under random utilities
by: MAI, Tien, et al.
Published: (2020) -
Heuristic algorithms for general k-level facility location problems
by: Li, R., et al.
Published: (2014) -
Heuristic algorithms for general k-level facility location problems
by: Li, R., et al.
Published: (2014) -
Packet scheduling based on set covering problem using greedy algorithm
by: Chatchanan Jandaeng
Published: (2014) -
Least squares approximation to stochastic optimization problems
by: ZHENG, Zhichao, et al.
Published: (2015)