이분할성 우선순위제약을 갖는 배낭문제에 대한 다면체적 절단평면 Facets of Knapsack Polytopes with Bipartite Precedence Constraints

We consider the precedence-constrained knapsack problem. which is a knapsack problem with precedence constraints imposed on the set of variables. Especially, we focus on the case where the precedence constraints cir be represented as a bipartite graph, which occurs most frequently in applications. Based on the previous studios for the general case, we specialize the polyhedral results on the related polytope and derive stronger results on the facet-defining properties of the inequalities.
Publisher
한국경영과학회
Issue Date
1998-01
Language
KOR
Citation

한국경영과학회지, v.23, no.4, pp.1 - 10

ISSN
1225-1119
URI
http://hdl.handle.net/10203/71523
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
  • Hit : 187
  • Download : 0
  • Cited 0 times in thomson ci

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0