Soft car sequencing with colors: Lower bounds and optimality proofs.
Thierry BenoistPublished in: Eur. J. Oper. Res. (2008)
Keyphrases
- lower bound
- optimal solution
- upper bound
- branch and bound
- color images
- branch and bound algorithm
- theorem proving
- np hard
- objective function
- color information
- lower and upper bounds
- worst case
- lower bounding
- upper and lower bounds
- color space
- color quantization
- natural deduction
- color matching
- theorem prover
- linear programming relaxation
- exact methods
- optimal cost
- equational theories
- set of randomly generated instances
- randomly generated problems
- vc dimension
- color histogram
- knapsack problem