Bilevel Programming and Maximally Violated Valid Inequalities
暂无分享,去创建一个
[1] William J. Cook,et al. The Traveling Salesman Problem: A Computational Study , 2007 .
[2] Matteo Fischetti,et al. Optimizing over the first Chvátal closure , 2005, Math. Program..
[3] Andrea Lodi,et al. On the MIR Closure of Polyhedra , 2007, IPCO.
[4] S. Dempe. Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints , 2003 .
[5] Matteo Fischetti,et al. On the separation of disjunctive cuts , 2011, Math. Program..
[6] Hanif D. Sherali,et al. Disjunctive Programming , 2009, Encyclopedia of Optimization.
[7] Patrice Marcotte,et al. Bilevel programming: A survey , 2005, 4OR.
[8] Egon Balas,et al. Optimizing over the split closure , 2008, Math. Program..
[9] Gérard Cornuéjols,et al. Polyhedral study of the capacitated vehicle routing problem , 1993, Math. Program..
[10] Giovanni Rinaldi,et al. Easy and difficult objective functions for max cut , 2003, Math. Program..
[11] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[12] Jonathan F. Bard,et al. The Mixed Integer Linear Bilevel Programming Problem , 1990, Oper. Res..
[13] Alberto Caprara,et al. On the separation of split cuts and related inequalities , 2003, Math. Program..
[14] J. F. Pierce,et al. ON THE TRUCK DISPATCHING PROBLEM , 1971 .