On Dual Based Lower Bounds for the Sequential Ordering Problem with Precedences and Due Dates.
Antonio Alonso-AyusoPaolo DettiLaureano F. EscuderoM. Teresa OrtuñoPublished in: Ann. Oper. Res. (2003)
Keyphrases
- lower bound
- partial order
- upper bound
- branch and bound algorithm
- precedence constraints
- lower and upper bounds
- branch and bound
- np hard
- partial ordering
- objective function
- upper and lower bounds
- lower bounding
- partially ordered
- worst case
- quadratic assignment problem
- optimal cost
- optimal solution
- lagrangian relaxation
- learning algorithm
- online algorithms
- data sets
- set of randomly generated instances
- sequential data
- knapsack problem
- multi dimensional