Sign Up to like & get
recommendations!
0
Published in 2018 at "Computational Optimization and Applications"
DOI: 10.1007/s10589-018-9995-0
Abstract: In this work we present two matheuristic procedures to build good feasible solutions (frequently, the optimal one) by considering the solutions of relaxed problems of large-sized instances of the multi-period stochastic pure 0–1 location-assignment problem.…
read more here.
Keywords:
multi period;
period stochastic;
location;
location assignment ... See more keywords