Confidence-based reasoning in stochastic constraint programming

Rossi, 2011, Finding (α,ϑ)-solutions via sampled SCSP, 2172 Walsh, 2002, Stochastic constraint programming, 111 Tarim, 2006, Stochastic constraint programming: a scenario-based approach, Constraints, 11, 53, 10.1007/s10601-006-6849-7 Hnich, 2012, Filtering algorithms for global chance constraints, Artif. Intell., 189, 69, 10.1016/j.artint.2012.05.001 Costantini, 2014 Rossi, 2006 Hnich, 2009, Synthesizing filtering algorithms for global chance-constraints, vol. 5732, 439 Prestwich, 2015, Hybrid metaheuristics for stochastic constraint programming, Constraints, 20, 57, 10.1007/s10601-014-9170-x Jeffreys, 1961 Clopper, 1934, The use of confidence or fiducial limits illustrated in the case of the binomial, Biometrika, 26, 404, 10.1093/biomet/26.4.404 Agresti, 1998, Approximate is better than “exact” for interval estimation of binomial proportions, Am. Stat., 52, 119 Evans, 2000 Upton, 2002 Sethi, 1991, A theory of rolling horizon decision making, Ann. Oper. Res., 29, 387, 10.1007/BF02283607 Sadooghi-Alvandi, 2009, On the distribution of the sum of independent uniform random variables, Stat. Pap., 50, 171, 10.1007/s00362-007-0049-4 Miller, 1981 Killmann, 2001, A note on the convolution of the uniform and related distributions and their use in quality control, Econ. Qual. Control, 16, 17, 10.1515/EQC.2001.17 Lehmann, 2005, Generalizations of the familywise error rate, Ann. Stat., 33, 1138, 10.1214/009053605000000084 Smith, 2013, Multiplicity control in structural equation modeling: incorporating parameter dependencies, Struct. Equ. Model., 20, 79, 10.1080/10705511.2013.742385 David, 2003 Laburthe, 1994 Martello, 1990 Kleywegt, 2001, The sample average approximation method for stochastic discrete optimization, SIAM J. Optim., 12, 479, 10.1137/S1052623499363220 Kleywegt, 1998, The dynamic and stochastic knapsack problem, Oper. Res., 46, 17, 10.1287/opre.46.1.17 Kall, 2011, Stochastic Linear Programming: Models, Theory and Computation, 10.1007/978-1-4419-7729-8 Ağralı, 2009, A single-resource allocation problem with Poisson resource requirements, Optim. Lett., 3, 559, 10.1007/s11590-009-0135-8 Garey, 1979 Aggoun, 1993, Extending chip in order to solve complex scheduling and placement problems, Math. Comput. Model., 17, 57, 10.1016/0895-7177(93)90068-A Bookbinder, 1988, Strategies for the probabilistic lot-sizing problem with service-level constraints, Manag. Sci., 34, 1096, 10.1287/mnsc.34.9.1096 Vargas, 2009, An optimal solution for the stochastic version of the Wagner–Whitin dynamic lot-size model, Eur. J. Oper. Res., 198, 447, 10.1016/j.ejor.2008.09.003 Hunt, 2001, Complexity and approximability of quantified and stochastic constraint satisfaction problems, Electron. Notes Discrete Math., 9, 217, 10.1016/S1571-0653(04)00324-5 Dyer, 2006, Computational complexity of stochastic programming problems, Math. Program., 106, 423, 10.1007/s10107-005-0597-0 Papadimitriou, 1985, Games against nature, J. Comput. Syst. Sci., 31, 288, 10.1016/0022-0000(85)90045-5 Rossi, 2014, Confidence-based optimisation for the newsvendor problem under binomial, Poisson and exponential demand, Eur. J. Oper. Res., 239, 674, 10.1016/j.ejor.2014.06.007 Ahmed, 2002, The sample average approximation method for stochastic programs with integer recourse, SIAM J. Optim., 12, 479, 10.1137/S1052623499363220 Linderoth, 2006, The empirical behavior of sampling methods for stochastic programming, Ann. Oper. Res., 142, 215, 10.1007/s10479-006-6169-8 Wang, 2008, Sample average approximation of expected value constrained stochastic programs, Oper. Res. Lett., 36, 515, 10.1016/j.orl.2008.05.003 Branda, 2012, Sample approximation technique for mixed-integer stochastic programming problems with several chance constraints, Oper. Res. Lett., 40, 207, 10.1016/j.orl.2012.01.002 Branda, 2012, Stochastic programming problems with generalized integrated chance constraints, Optimization, 61, 949, 10.1080/02331934.2011.587007 Ahmed, 2008, Solving chance-constrained stochastic programs via sampling and integer programming, 261 Luedtke, 2008, A sample approximation approach for optimization with probabilistic constraints, SIAM J. Optim., 19, 674, 10.1137/070702928 Pagnoncelli, 2009, Sample average approximation method for chance constrained programming: theory and applications, J. Optim. Theory Appl., 142, 399, 10.1007/s10957-009-9523-6 Chernoff, 1952, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Stat., 23, 10.1214/aoms/1177729330 Hoeffding, 1963, Probability inequalities for sums of bounded random variables, J. Am. Stat. Assoc., 58, 13, 10.1080/01621459.1963.10500830 Branda, 2013, On relations between chance constrained and penalty function problems under discrete distributions, Math. Methods Oper. Res., 77, 265, 10.1007/s00186-013-0428-7 Brown, 2006, Uncertainty and change, 729 Hnich, 2011, A survey on CP-AI-OR hybrids for decision making under uncertainty, vol. 45, 227 Charnes, 1963, Deterministic equivalents for optimizing and satisficing under chance constraints, Oper. Res., 11, 18, 10.1287/opre.11.1.18 Birge, 1997 Benoist, 2001, Towards stochastic constraint programming: a study of online multi-choice knapsack with deadlines, vol. 2239, 61 Balafoutis, 2006, Algorithms for stochastic CSPs, vol. 4204, 44 Bordeaux, 2007, On the stochastic constraint satisfaction framework, 316 Rossi, 2008, A global chance-constraint for stochastic inventory systems under service level constraints, Constraints, 13, 490, 10.1007/s10601-007-9038-4 Rossi, 2008, Cost-based domain filtering for stochastic constraint programming, vol. 5202, 235 Prestwich, 2009, Evolving parameterised policies for stochastic constraint programming, vol. 5732, 684 Littman, 2001, Stochastic boolean satisfiability, J. Autom. Reason., 27, 251, 10.1023/A:1017584715408 van Hentenryck, 2006, Online stochastic reservation systems, vol. 3990, 212 Katriel, 2007, Commitment under uncertainty: two-stage stochastic matching problems, vol. 4596, 171 Beck, 2007, Proactive algorithms for job shop scheduling with probabilistic durations, J. Artif. Intell. Res., 28, 183, 10.1613/jair.2080 Michel, 2004, Iterative relaxations for iterative flattening in cumulative scheduling, 200 Bent, 2004, Regrets only! online stochastic optimization under time constraints, 501 Bent, 2005, Sub-optimality approximations, vol. 3709, 122 Yates, 2002 McKay, 1979, A comparison of three methods for selecting values of input variables in the analysis of output from a computer code, Technometrics, 21, 239 Neyman, 1935, On the problem of confidence limits, Ann. Math. Stat., 6, 111, 10.1214/aoms/1177732585 Benhamou, 2006, Continuous and interval constraints, 569 Rossi, 2014, Statistical constraints, vol. 263, 777