Complete description of a class of knapsack polytopes

Author： Dahl G.   Foldnes N.  

Publisher： Elsevier

ISSN： 0167-6377

Source： Operations Research Letters, Vol.31, Iss.5, 2003-09, pp. : 335-340

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On Facets of Knapsack Equality Polytopes

By Lee E.K.  

Journal of Optimization Theory and Applications, Vol. 94, Iss. 1, 1997-07 ,pp. : 223-239

Springer Publishing Company

Access to resources Recommend Favorite

A complete description of cones and polytopes including hypervolumes of all facets of a polytope

By Jubete F.   Castillo E.  

International Journal of Mathematical Education in Science and Technology, Vol. 38, Iss. 1, 2007-01 ,pp. : 85-102

Taylor & Francis Ltd

Access to resources Recommend Favorite

Solving a Class of Multiplicative Programs with 0–1 Knapsack Constraints

By Kuno T.  

Journal of Optimization Theory and Applications, Vol. 103, Iss. 1, 1999-10 ,pp. : 121-135

Springer Publishing Company

Access to resources Recommend Favorite

Base polytopes of series-parallel posets: Linear description and optimization

By Schrader R.   Schulz A.S.   Wambach G.  

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 159-173

Elsevier

Access to resources Recommend Favorite

A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes

By Murty Katta  

Optimization Letters, Vol. 3, Iss. 2, 2009-03 ,pp. : 211-237

Springer Publishing Company

Access to resources Recommend Favorite