Combinatorial Relaxation Bounds and Preprocessing for Berth Allocation Problems.
Evellyn CavalcanteJohan OppenPhillippe SamerSebastián UrrutiaPublished in: Electron. Notes Discret. Math. (2016)
Keyphrases
- allocation problems
- preprocessing
- resource allocation
- upper bound
- lower bound
- upper and lower bounds
- post processing
- preprocessing step
- feature extraction
- probabilistic relaxation
- lower and upper bounds
- lagrangian relaxation
- error bounds
- allocation policies
- worst case
- container terminal
- lognormal distribution
- confidence bounds
- preprocessing steps
- generalization bounds
- semidefinite
- iterative algorithms
- preprocessing phase
- vc dimension
- orders of magnitude