The continuous knapsack set
暂无分享,去创建一个
[1] Alper Atamtürk,et al. On splittable and unsplittable flow capacitated network design arc–set polyhedra , 2002, Math. Program..
[2] Pierre Pestieau,et al. Lobbying, Family Concerns, and the Lack of Political Support for Estate Taxation , 2015 .
[3] Hande Yaman. The splittable flow arc set with capacity and minimum load constraints , 2013, Oper. Res. Lett..
[4] Vladimir Shikhman,et al. Algorithmic models of market equilibrium , 2013 .
[5] Thierry Bréchet,et al. Modeling of environmental adaptation versus pollution mitigation , 2014 .
[6] Nigar Hashimzade,et al. Solutions Manual to Accompany Intermediate Public Economics , 2006 .
[7] Thomas L. Magnanti,et al. The convex hull of two core capacitated network design problems , 1993, Math. Program..
[8] Laurence A. Wolsey,et al. Mixing Sets Linked by Bidirected Paths , 2011, SIAM J. Optim..
[9] Alper Atamtürk,et al. Network design arc set with variable upper bounds , 2007, Networks.
[10] George L. Nemhauser,et al. Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms , 2002, IPCO.
[11] Miguel Fragoso Constantino,et al. Description of 2-integer continuous knapsack polyhedra , 2006, Discret. Optim..
[12] M. Joerg. k-disjunctive cuts and cutting plane algorithms for general mixed integer linear programs , 2008 .
[13] Alper Atamtürk,et al. On capacitated network design cut–set polyhedra , 2002, Math. Program..
[14] George L. Nemhauser,et al. Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms , 2002, Math. Program..
[15] Vladimir Shikhman,et al. Convergent subgradient methods for nonsmooth convex minimization , 2014 .
[16] Jean Jaskold Gabszewicz,et al. Social awareness and duopoly competition , 2013 .
[17] Thomas L. Magnanti,et al. Modeling and Solving the Two-Facility Capacitated Network Loading Problem , 1995, Oper. Res..