Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Collection

toTop

If you have any feedback, Please follow the official account to submit feedback.

Turn on your phone and scan

home > search >

K-PPM: a new exact method to solve multi-objective combinatorial optimization problems

Journal:
European Journal of Operational Research


Issue Date:
2010


Abstract(summary):

In this paper we propose an exact method able to solve multi-objective combinatorial optimization problems. This method is an extension, for any number of objectives, of the 2-parallel partitioning method (2-PPM) we previously proposed. Like 2-PPM, this method is based on splitting of the search space into several areas, leading to elementary searches. The efficiency of the proposed method is evaluated using a multi-objective flow-shop problem. [All rights reserved Elsevier].


Page:
45---5353


Similar Literature

Submit Feedback

This function is a member function, members do not limit the number of downloads