SOLVING HUGE SIZE INSTANCES OF THE OPTIMAL DIVERSITY MANAGEMENT PROBLEM

摘要

We report a real application project in a car industry optimization problem known as the optimal diversity management problem. We provide an alternative proof of NP-hardness, and we give and discuss the results obtained from a greedy algorithm applied to huge size instances.