On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problems
暂无分享,去创建一个
[1] Michael M. Kostreva,et al. Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models , 1985, Oper. Res..
[2] A. Garín,et al. On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0–1 mixed integer programs , 1996 .
[3] Martin W. P. Savelsbergh,et al. Preprocessing and Probing Techniques for Mixed Integer Programming Problems , 1994, INFORMS J. Comput..
[4] Martin W. P. Savelsbergh,et al. Sequence Independent Lifting of Cover Inequalities , 1995, IPCO.
[5] Paolo Toth,et al. A Framework for Tightening 0-1 Programs Based on Extensions of Pure 0-1 KP and SS Problems , 1995, IPCO.
[6] S. Martello,et al. A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem , 1984 .
[7] Martin W. P. Savelsbergh,et al. MINTO, a mixed INTeger optimizer , 1994, Oper. Res. Lett..
[8] Gautam Mitra,et al. Analysis of mathematical programming problems prior to applying the simplex algorithm , 1975, Math. Program..
[9] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[10] M. J. Maher,et al. Model Building in Mathematical Programming , 1978 .
[11] E. Balas,et al. Facets of the Knapsack Polytope From Minimal Covers , 1978 .
[12] Monique Guignard-Spielberg,et al. Logical Reduction Methods in Zero-One Programming - Minimal Preferred Variables , 1981, Oper. Res..
[13] Laureano F. Escudero,et al. On tightening cover induced inequalities , 1992 .
[14] George L. Nemhauser,et al. Lifted cover facets of the 0-1 knapsack polytope with GUB constraints , 1994, Oper. Res. Lett..
[15] Laurence A. Wolsey,et al. Solving Mixed Integer Programming Problems Using Automatic Reformulation , 1987, Oper. Res..
[16] Laurence Wolsey,et al. Strong formulations for mixed integer programming: A survey , 1989, Math. Program..
[17] Laureano F. Escudero,et al. On characterizing tighter formulations for 0-1 programs , 1998, Eur. J. Oper. Res..
[18] Egon Balas,et al. Facets of the knapsack polytope , 1975, Math. Program..
[19] Laureano F. Escudero,et al. S3 sets. An extension of the Beale-Tomlin special ordered sets , 1988, Math. Program..
[20] Manfred W. Padberg,et al. Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut , 1991, INFORMS J. Comput..
[21] Brenda L Dietrich,et al. O(n) Procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates , 1993 .
[22] Uwe H. Suhl. Solving large-scale mixed-integer programs with fixed charge variables , 1985, Math. Program..
[23] G. Nemhauser,et al. Integer Programming , 2020 .
[24] S. Martello,et al. A New Algorithm for the 0-1 Knapsack Problem , 1988 .
[25] Ellis L. Johnson,et al. Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..
[26] Laureano F. Escudero,et al. Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds , 1990 .
[27] Michael S. Waterman,et al. COMPUTATION OF GENERATING FUNCTIONS FOR BIOLOGICAL MOLECULES , 1980 .
[28] Laureano F. Escudero,et al. Efficient Reformulation for 0-1 Programs - Methods and Computational Results , 1993, Discret. Appl. Math..