Dual-Feasible Functions for Integer Programming and Combinatorial Optimization

This book provides a postgraduate audience the keys they need to understand and further develop a set of tools for the efficient computation of lower bounds and valid inequalities in integer programs and combinatorial optimization problems.

Aceasta carte ofera unui public postuniversitar cheile de care au nevoie pentru a intelege si a dezvolta in continuare un set de instrumente pentru calcularea eficienta a limitelor inferioare si a inegalitatilor valide in programele intregi si problemele de optimizare combinatorie.