Lagrangian relaxation for optimal corpus design.

Jonathan Chevelu Nelly Barbot Olivier Boëffard Arnaud Delhay

Published in: SSW (2007)

Keyphrases

lagrangian relaxation
dynamic programming
lower bound
integer programming
optimal solution
shortest path
column generation
capacity constraints
relaxation algorithm
dual decomposition