Skip to content

Latest commit

 

History

7 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 

Repository files navigation

SLMCLP

Maximal covering location problem with customer preference ordering

This was part of a student assignment for the course "Selected chapters of optimization" at Faculty of Mathematics.

Literature used:

Cánovas L., García S., Labbé M., Marín A. (2007). A strengthened formulation for the simple plant location problem with order.,Operations Research Letters, 35(2), 141-150

Díaz J.A., Luna D., Camacho-Vallejo JF., Casas-Ramírez MS. (2017). GRASP and hybrid GRASP-Tabu heuristis to solve maximal covering location problem with customer preference ordering, Expert Systems With Applications 82, 67-76

About

Maximal covering location problem with customer preference ordering

Topics

Resources

Stars

3 stars

Watchers

0 watching

Forks

Releases

Packages

Used by

Contributors

Languages