Learn More
Many real-world optimization problems involve balancing multiple objectives. When there is no solution that is best with respect to all objectives, it is often desirable to compute the Pareto front. This paper proposes queued Pareto local search (QPLS), which improves on existing Pareto local search (PLS) methods by maintaining a queue of improvements(More)
  • 1