I wonder what relation and difference are between combinatorial optimization and discrete optimization? Thanks!
Originally by reading Wikipedia, I thought discrete optimization consists of combinatorial optimization and integer optimization, where the combinatorial one is to search over a finite set of solutions, and the integer one is to search over a countably infinite set of solutions.
But after reading the table of content of Bernhard Korte and Jens Vygen Combinatorial Optimization: Theory and Algorithms, I saw they include integer programming in their combinatorial optimization book. Now I am confused.