Chance-Constrained Binary Packing Problems
暂无分享,去创建一个
[1] James R. Luedtke,et al. A Sample Approximation Approach for Optimization with Probabilistic Constraints , 2008, SIAM J. Optim..
[2] A. Charnes,et al. Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints , 1963 .
[3] Gregory Gutin,et al. The traveling salesman problem , 2006, Discret. Optim..
[4] Adam N. Letchford,et al. Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem , 2008, Eur. J. Oper. Res..
[5] Patrizia Beraldi,et al. An exact approach for solving integer problems under probabilistic constraints with random technology matrix , 2010, Ann. Oper. Res..
[6] Alexander Shapiro,et al. Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications , 2009, J. Optimization Theory and Applications.
[7] Miguel A. Lejeune,et al. Pattern-Based Modeling and Solution of Probabilistically Constrained Optimization Problems , 2012, Oper. Res..
[8] Manfred W. Padberg,et al. A Note on Zero-One Programming , 2016 .
[9] Patrizia Beraldi,et al. The Probabilistic Set-Covering Problem , 2002, Oper. Res..
[10] Giuseppe Carlo Calafiore,et al. Uncertain convex programs: randomized solutions and confidence levels , 2005, Math. Program..
[11] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.
[12] Alper Atamtürk,et al. Sequence Independent Lifting for Mixed-Integer Programming , 2004, Oper. Res..
[13] Alper Atamtürk,et al. The submodular knapsack polytope , 2009, Discret. Optim..
[14] Alexander Shapiro,et al. Convex Approximations of Chance Constrained Programs , 2006, SIAM J. Optim..
[15] Marco C. Campi,et al. A Sampling-and-Discarding Approach to Chance-Constrained Optimization: Feasibility and Optimality , 2011, J. Optim. Theory Appl..
[16] William J. Cook,et al. Local cuts for mixed-integer programming , 2013, Math. Program. Comput..
[17] Adam N. Letchford,et al. Separation algorithms for 0-1 knapsack polytopes , 2010, Math. Program..
[18] Yongjia Song. Structure-exploiting algorithms for chance-constrained and integer stochastic programs , 2013 .
[19] Simge Küçükyavuz,et al. On mixing sets arising in chance-constrained programming , 2012, Math. Program..
[20] Lewis Ntaimo,et al. IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation , 2010, Eur. J. Oper. Res..
[21] Patrizia Beraldi,et al. Capital rationing problems under uncertainty and risk , 2012, Comput. Optim. Appl..
[22] Matteo Fischetti,et al. Embedding Cuts in a Branch & Cut Framework : a Computational Study with { 0 , 12 }-Cuts , 2003 .
[23] Maria Gabriela Martinez,et al. Regularization methods for optimization problems with probabilistic constraints , 2013, Math. Program..
[24] Eitan Zemel,et al. Easily Computable Facets of the Knapsack Polytope , 1989, Math. Oper. Res..
[25] Miguel A. Lejeune,et al. MIP reformulations of the probabilistic set covering problem , 2010, Math. Program..
[26] E. Balas,et al. Facets of the Knapsack Polytope From Minimal Covers , 1978 .
[27] Martin W. P. Savelsbergh,et al. Lifted Cover Inequalities for 0-1 Integer Programs: Computation , 1998, INFORMS J. Comput..
[28] Manfred W. Padberg. Technical Note - A Note on Zero-One Programming , 1975, Oper. Res..
[29] A. Schrijver,et al. The Traveling Salesman Problem , 2011 .
[30] Jean-Philippe Vial,et al. Robust Optimization , 2021, ICORES.
[31] William J. Cook,et al. The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) , 2007 .
[32] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .
[33] Matteo Fischetti,et al. Embedding {0, }-Cuts in a Branch-and-Cut Framework: A Computational Study , 2007, INFORMS J. Comput..
[34] George L. Nemhauser,et al. An integer programming approach for linear programs with probabilistic constraints , 2007, Math. Program..
[35] Ted K. Ralphs,et al. Integer and Combinatorial Optimization , 2013 .
[36] Giuseppe Carlo Calafiore,et al. The scenario approach to robust control design , 2006, IEEE Transactions on Automatic Control.
[37] Andrzej Ruszczynski,et al. Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra , 2002, Math. Program..
[38] James R. Luedtke. An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs , 2010, IPCO.
[39] Martin W. P. Savelsbergh,et al. Lifted Cover Inequalities for 0-1 Integer Programs: Complexity , 1999, INFORMS J. Comput..
[40] Manfred W. Padberg,et al. On the facial structure of set packing polyhedra , 1973, Math. Program..
[41] Laurence A. Wolsey,et al. Covering Linear Programming with Violations , 2014, INFORMS J. Comput..
[42] Darinka Dentcheva,et al. Concavity and efficient points of discrete distributions in probabilistic programming , 2000, Math. Program..
[43] James R. Luedtke. A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support , 2013, Mathematical Programming.