论文信息 - On the extremality of maximal dual feasible functions

On the extremality of maximal dual feasible functions

Abstract Dual feasible functions have been used to compute bounds and valid inequalities for combinatorial optimization problems. Here, we analyze the properties of some of the best functions proposed so far. Additionally, we provide new results for composed functions. These results will allow improving the computation of bounds and valid inequalities.

[1] Cláudio Alves,et al. A survey of dual-feasible and superadditive functions , 2010, Ann. Oper. Res..

[2] David S. Johnson,et al. Near-optimal bin packing algorithms , 1973 .

[3] Cláudio Alves,et al. Theoretical investigations on maximal dual feasible functions , 2010, Oper. Res. Lett..

[4] Jacques Carlier,et al. Computing redundant resources for the resource constrained project scheduling problem , 2007, Eur. J. Oper. Res..

[5] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[6] François Vanderbeck,et al. Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem , 2000, Oper. Res..

[7] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.

[8] Sanjeeb Dash,et al. Valid inequalities based on simple mixed-integer sets , 2004, Math. Program..

[9] Sándor P. Fekete,et al. New classes of fast lower bounds for bin packing problems , 2001, Math. Program..

[10] Claude-Alain Burdet,et al. A Subadditive Approach to Solve Linear Integer Programs , 1977 .

[11] Andrea Lodi,et al. Strengthening Chvátal-Gomory cuts and Gomory fractional cuts , 2002, Oper. Res. Lett..