Weismantel (1997). On the 0/1 Knapsack Polytope. Math. Prog. 77(1), 49-68. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Discrete Relaxations of Combinatorial Programs - Borndörfer, Weismantel (2000) (1 citation) (Correct)
....knapsack capacity. We denote the associated knapsack polytope by PSKP = PSKP (a; Basic inequalities for PSKP are cover inequalities, see, e.g. Wolsey (1975) 18] 1; k) con guration inequalities, see Padberg (1980) 12] and weight and extended weight inequalities, see Weismantel (1997) [16]. The remainder of this section gives two examples of knapsack relaxations for the multiple knapsack and the node capacitated graph partitioning problem. 3.1 The Multiple Knapsack Problem The multiple knapsack problem is the integer program (MKP) max X i2I X k2K w i x ik (i) X i2I a i x ....
Weismantel (1997). On the 0/1 Knapsack Polytope. Math. Prog. 77(1), 49-68.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC