论文信息 - Theoretical investigations on maximal dual feasible functions

Theoretical investigations on maximal dual feasible functions

Dual feasible functions are used to get valid inequalities and lower bounds for integer linear problems. In this paper, we provide a simpler proof for maximality, and we describe new results concerning the extremality of functions from the literature. Extremal functions are a dominant class of dual feasible functions.

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

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

[3] Jacques Carlier,et al. New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation , 2007, Comput. Oper. Res..

[4] David S. Johnson,et al. `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.

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

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

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

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

[9] Cláudio Alves,et al. New Stabilization Procedures for the Cutting Stock Problem , 2011, INFORMS J. Comput..