论文信息 - Cutting planes for mixed-integer knapsack polyhedra

Cutting planes for mixed-integer knapsack polyhedra

An algorithm for generating cutting planes for mixed-integer knapsack polyhedra is described. The algorithm represents an exact separation procedure and is based on a general methodology proposed by one of the authors in an earlier paper. Computational results are presented. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.

E. Andrew Boyd | Xiao-Qing Yan

[1] Manfred W. Padberg,et al. Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut , 1991, INFORMS J. Comput..

[2] Michael M. Kostreva,et al. Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models , 1985, Oper. Res..

[3] E. Andrew Boyd. On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming , 1995, SIAM J. Optim..

[4] E. Andrew Boyd,et al. Fenchel Cutting Planes for Integer Programs , 1994, Oper. Res..

[5] Ellis L. Johnson,et al. Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..

[6] Ellis L. Johnson,et al. A note of the knapsack problem with special ordered sets , 1981, Oper. Res. Lett..

[7] E. Andrew Boyd,et al. Generating Fenchel Cutting Planes for Knapsack Polyhedra , 1993, SIAM J. Optim..