Sub-optimality approximations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3709 LNCS, Issue , 2005, Pages 122-136

  Bent, Russell ^a   Katriel, Irit ^b   Van Hentenryck, Pascal ^a  

^a BROWN UNIVERSITY   (United States)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING; STOCHASTIC CONTROL SYSTEMS;

OPTIMIZATION CONSTRAINTS; OPTIMIZATION PROBLEM; STOCHASTIC OPTIMIZATION ALGORITHMS; SUB-OPTIMALITY APPROXIMATIONS;

APPROXIMATION THEORY;

EID: 33646182668     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_12     Document Type: Conference Paper

References (15)

1. Arya, V. and Garg, N. and Khandekar, R. and Pandit, V. Local search heuristics for k-median and facility location problems. In Proceedings of the 33rd ACM Symposium on the Theory of Computing (STOC 2001), 2001.
2. R. Bent and P. Van Hentenryck. Online Stochastic and Robust Optimization. In ASIAN'04, Chiang Mai University, Thailand, December 2004.
3. R. Bent and P. Van Hentenryck. Regrets Only. Online Stochastic Optimization under Time Constraints. In AAAI'04, San Jose, CA, July 2004.
4. R. Bent and P. Van Hentenryck. Scenario Based Planning for Partially Dynamic Vehicle Routing Problems with Stochastic Customers. O.R., 52(6), 2004.
5. R. Bent and P. Van Hentenryck. The Value of Consensus in Online Stochastic Scheduling. In ICAPS 2004, Whistler, British Columbia, Canada, 2004.
6. R. Bent and P. Van Hentenryck. Online Stochastic Optimization without Distributions . In ICAPS 2005, Monterey, CA, 2005.
7. R. Bent and P. Van Hentenryck and Eli Ufval. Online Stochastic Optimization Under Time Constraints. Working Paper, 2005.
8. H. Chang, R. Givan, and E. Chong. On-line Scheduling Via Sampling. Artificial Intelligence Planning and Scheduling (AIPS'00), pages 62-71, 2000.
9. Chrobak, M. and Kenyon, C. and Young, N.. The reverse greedy algorithm for the metric k-median problem. In The Eleventh International Computing and Combinatorics Conference (Cocoon 2005), Kunming, Yunnan, 2005.
10. F. Dabek, R. Cox, F. Kaashoek, and R. Morris. Vivaldi: A Decentralized Network Coordinate System. In SIGCOMM 2004, August 2004.
11. A. Fiat and G. Woeginger. Online Algorithms: The State of the Art. 1998.
12. F. Focacci, A. Lodi, and M. Milano. Optimization-Oriented Global Constraints. Constraints, 7(3-4):351-365, 2002.
13. C. Lund and M. Yannakakis. On the Hardness of Approximating Minimization Problems. In STOC-93, New York, NY, 1993.
14. L. Michel and P. Van Hentenryck. A Simple Tabu Search for Warehouse Location. European Journal of Operational Research, 157(3):576-591, 2004.
15. P. Van Hentenryck, P. Flener, J. Pearson, and M. Ågren. Tractable symmetry breaking for csps with interchangeable values. IJCAI'03.