Login / Signup

A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs.

John SylvaAlejandro Crema
Published in: Eur. J. Oper. Res. (2007)
Keyphrases
  • multiple objectives
  • dynamic programming
  • cost function
  • probabilistic model
  • support vector machine
  • optimization problems