User menu

The Continuous Knapsack Set

Bibliographic reference Dash, Sanjeeb ; Günlük, Oktay ; Wolsey, Laurence. The Continuous Knapsack Set. In: Mathematical Programming, Vol. 155, no.1-2, p. 471-496 (2015)
Permanent URL http://hdl.handle.net/2078.1/173106
  1. Atamtürk Alper, Günlük Oktay, Network design arc set with variable upper bounds, 10.1002/net.20162
  2. Agra A., Constantino M., Description of 2-integer continuous knapsack polyhedra, 10.1016/j.disopt.2005.10.008
  3. Jörg, M.: $$k$$ k -disjunctive cuts and cutting plane algorithms for general mixed integer linear programs. arXiv:0707.3945 (2007)
  4. Atamt�rk Alper, On capacitated network design cut?set polyhedra, 10.1007/s101070100284
  5. Di Summa Marco, Wolsey Laurence A., Mixing Sets Linked by Bidirected Paths, 10.1137/100811799
  6. Magnanti Thomas L., Mirchandani Prakash, Vachani Rita, The convex hull of two core capacitated network design problems, 10.1007/bf01580612
  7. Magnanti Thomas L., Mirchandani Prakash, Vachani Rita, Modeling and Solving the Two-Facility Capacitated Network Loading Problem, 10.1287/opre.43.1.142
  8. Richard J.-P.P., de Farias Jr I.R., Nemhauser G.L., Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms, 10.1007/s10107-003-0398-2
  9. Wolsey, L.A., Yaman, H.: The continuous knapsack set with divisible capacities. CORE Discussion Paper DP 2013/63, University of Louvain, Louvain-la-Neuve, Belgium (2013)
  10. Yaman Hande, The splittable flow arc set with capacity and minimum load constraints, 10.1016/j.orl.2013.07.005