Theoretical investigations on maximal dual feasible functions

Authors:
JüRgen Rietz;CláUdio Alves;J.M. ValéRio De Carvalho
Affiliations:
Centro de Investigação Algoritmi da Universidade do Minho, Escola de Engenharia, Universidade do Minho, 4710-057 Braga, Portugal;Centro de Investigação Algoritmi da Universidade do Minho, Escola de Engenharia, Universidade do Minho, 4710-057 Braga, Portugal;Centro de Investigação Algoritmi da Universidade do Minho, Escola de Engenharia, Universidade do Minho, 4710-057 Braga, Portugal
Venue:
Operations Research Letters
Year:
2010

Citing 4
Cited 2

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications

Journal of the ACM (JACM)
Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem

Operations Research
New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation

Computers and Operations Research

General properties of staircase and convex dual feasible functions

WSEAS Transactions on Information Science and Applications
Conservative scales in packing problems

OR Spectrum

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.