Author:
Murat Cécile,Paschos Vangelis Th.
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of computer computations, pp. 85–103. Plenum Press, New York (1972)
2. Garey, M.R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman, San Francisco (1979)
3. Bertsimas, D.J., Jaillet, P., Odoni, A.: A priori optimization. Oper. Res. 38, 1019–1033 (1990)
4. Jaillet, P.: Probabilistic traveling salesman problem. Technical Report 185, Operations Research Center, MIT, Cambridge Mass., USA (1985)
5. Averbakh, I., Berman, O., Simchi-Levi, D.: Probabilistic a priori routing-location problems. Naval Res. Logistics 41, 973–989 (1994)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. General Bibliography;Paradigms of Combinatorial Optimization;2014-08-08
2. Probabilistic Combinatorial Optimization;Paradigms of Combinatorial Optimization;2013-02-13
3. A survey on combinatorial optimization in dynamic environments;RAIRO - Operations Research;2011-07
4. Probabilistic Coloring of Bipartite and Split Graphs;Computational Science and Its Applications – ICCSA 2005;2005