Solving continuous optimization problems via reduction to combinatorial optimization problems

76 Views Asked by At

In the literature, there are examples of reductions from discrete optimization problems to continuous optimization problems. I am aware that reductions are normally used to prove the complexity class of problems. However, I am wondering whether there are cases of continuous optimization problems solved via reduction to a combinatorial optimization problem (or maybe the other way around). If so, could you please name a few examples?