Is there such a thing as an NP-complete optimization (not decision) problem?
What is an example of an NP-complete optimization problem?
The decision versions of optimization problems are the ones in NP-complete. I can't think of any NP-hard optimizations that can be confirmed in polynomial time. I need verification/correction on this.
Thank you.