You've got be careful about getting locked into open systems. — IBM salesman. NP-hard problem in combinatorial optimization