论文信息 - A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems

A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems

The purpose of this paper is to show how hard (equality constrained) knapsack problems may be converted into constrained shortest path problems. Several directions along which such a transformation might be exploited for algorithmic purposes are suggested.

Celso C. Ribeiro | Michel Minoux | C. Ribeiro | M. Minoux

[1] R E Gomory,et al. ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS. , 1965, Proceedings of the National Academy of Sciences of the United States of America.

[2] Stanley Zionts,et al. Technical Note - Solving Integer Programming Problems by Aggregating Constraints , 1977, Oper. Res..

[3] Ravi Kannan,et al. Polynomial-Time Aggregation of Integer Programming Problems , 1983, JACM.

[4] David E. Bell. A Simple Algorithm for Integer Programs Using Group Constraints , 1977 .

[5] Gordon H. Bradley,et al. Transformation of integer programs to knapsack problems , 1971, Discret. Math..

[6] David E. Bell. Efficient group cuts for integer programs , 1979, Math. Program..

[7] Vasek Chvátal,et al. Hard Knapsack Problems , 1980, Oper. Res..

[8] Jeremy F. Shapiro,et al. A Convergent Duality Theory for Integer Programming , 1977, Oper. Res..