Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Lingxiao Huang, Jian Li. Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points. In Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi 0001, Bettina Speckmann, editors, Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I. Volume 9134 of Lecture Notes in Computer Science, pages 910-921, Springer, 2015. [doi]

The following publications are possibly variants of this publication:

Maximizing Expected Utility for Stochastic Combinatorial Optimization ProblemsJian Li, Amol Deshpande. focs 2011: 797-806 [doi]

Maximizing Expected Utility for Stochastic Combinatorial Optimization ProblemsJian Li, Amol Deshpande. mor, 44(1):354-375, 2019. [doi]

A noisy chaotic neural network for solving combinatorial optimization problems: stochastic chaotic simulated annealingLipo Wang, Sa Li, F. Tian, Xiuju Fu. tsmc, 34(5):2119-2125, 2004. [doi]

runs on WebDSL