We give a compact formulation for the clique inequalities defining the fractional node packing polytope on cocomparability, graphs. (C) 2003 Elsevier B.V. All rights reserved.
机构:
Department of Computer Science, Indiana Purdue Univ. at Fort Wayne, Fort WayneDepartment of Computer Science, Indiana Purdue Univ. at Fort Wayne, Fort Wayne
Liang Y.D.
Chang M.-S.
论文数: 0引用数: 0
h-index: 0
机构:
Dept. of Comp. Sci. and Info. Eng., National Chung Cheng University, Min-HsiungDepartment of Computer Science, Indiana Purdue Univ. at Fort Wayne, Fort Wayne