Constructing general dual-feasible functions

Abstract : Dual-feasible functions have proved to be very effective for generating fast lower bounds and valid inequalities for integer linear programs with knapsack constraints. However, a significant limitation is that they are defined only for positive arguments. Extending the concept of dual-feasible function to the general domain and range R is not straightforward. In this paper, we propose the first construction principles to obtain general functions with domain and range R, and we show that they lead to non-dominated maximal functions.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/hal-01214650
Contributor : François Clautiaux <>
Submitted on : Monday, October 12, 2015 - 5:09:22 PM
Last modification on : Thursday, May 16, 2019 - 3:54:05 PM

Identifiers

Citation

Claudio Alves, Juergen Rietz, José Manuel Valério de Carvalho, François Clautiaux. Constructing general dual-feasible functions. Operations Research Letters, Elsevier, 2015, 43 (4), pp.5. ⟨10.1016/j.orl.2015.06.002⟩. ⟨hal-01214650⟩

Share

Metrics

Record views

210