Finding an optimal tooth color match

Combinatorial Optimization You may have heard the aphorism that the more you learn, the less you know. The discipline of computer science is no exception: the more you delve into its depths, the more subfields that open up, each an entire province on its own. Combinatorial optimization is one of these subfields, and it lies at the fuzzy border between computer science and mathematics. Also known as discrete optimization, combinatorial optimization combines techniques of mathematics and computer science to solve optimization problems over discrete structures, e.g., graphs. Cook, et al. [2] present a straightforward introduction to combinatorial optimization.