Combinatorial Optimization

(Mathematical Optimization) ↑ Combinatorial Optimization ↓ find optimal object { finite set ofobjects } → discrete Examples Travelling Salesman Problem (“TSP”) Minimum Spanning Tree problem (“MST”) Combinatorial Optimization is a specialized subfield within the broader category of Mathematical Optimization. Unlike continuous optimization where solutions exist along an infinite spectrum, combinatorial optimization focuses on finding the ... Read More

Multi-Objective Optimization

Multi-Objective Optimization is an interesting approach where instead of focusing on one objective we simultaneously try to minimize or maximize more than one objective function. The objective functions are conflicting in multi-objective optimization problem because a single solution doesn’t optimize each objective simultaneously. Thus, the solution in multi-objective function is called nondominated or pareto optimal ... Read More
error: