Roger Z. Ríos-Mercado
According to our database1, Roger Z. Ríos-Mercado authored at least 37 papers between 1998 and 2019.
Legend:Book In proceedings Article PhD thesis Other
An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation.
European Journal of Operational Research, 2019
Metaheuristics for Natural Gas Pipeline Networks.
Proceedings of the Handbook of Heuristics., 2018
An iterated greedy heuristic for a market segmentation problem with multiple attributes.
European Journal of Operational Research, 2017
Operations research at CLAIO XVII (ALIO/SMIO Joint International Meeting).
Annals OR, 2017
A novel model for arc territory design: promoting Eulerian districts.
GRASP with path relinking for commercial districting.
Expert Syst. Appl., 2016
Assessing a Metaheuristic for Large-Scale Commercial Districting.
Cybernetics and Systems, 2016
Improving the quality of heuristic solutions for the capacitated vertex p-center problem through iterated greedy local search with variable neighborhood descent.
Computers & OR, 2015
A dual bounding scheme for a territory design problem.
Computers & OR, 2014
Embotelladoras ARCA Uses Operations Research to Improve Territory Design Plans.
GRASP strategies for a bi-objective commercial territory design problem.
J. Heuristics, 2013
A GRASP for a Multi-depot Multi-commodity Pickup and Delivery Problem with Time Windows and Heterogeneous Fleet in the Bottled Beverage Industry.
Proceedings of the Computational Logistics - 4th International Conference, 2013
A New Heuristic for the Capacitated Vertex p-Center Problem.
Proceedings of the Advances in Artificial Intelligence, 2013
Commercial Territory Design for a Distribution Firm with New Constructive and Destructive Heuristics.
Int. J. Comput. Intell. Syst., 2012
Procedimiento divide y vencerás para el diseño de territorios comerciales.
Computación y Sistemas, 2012
A disjunctive programming model and a rolling horizon algorithm for optimal multiperiod capacity expansion in a multiproduct batch plant.
Computers & Chemical Engineering, 2012
Multiobjective scatter search for a commercial territory design problem.
Annals OR, 2012
Preface: Operations research and systems (ALIO/INFORMS Joint International Meeting).
Annals OR, 2012
A GRASP with Strategic Oscillation for a Commercial Territory Design Problem with a Routing Budget Constraint.
Proceedings of the Advances in Soft Computing, 2011
A novel maximum dispersion territory design model arising in the implementation of the WEEE-directive.
A scatter search based hyper-heuristic for sequencing a mixed-model assembly line.
J. Heuristics, 2010
Special issue of the Journal of Heuristics on "Heuristic Research: Advances and Applications".
J. Heuristics, 2009
A reactive GRASP for a commercial territory design problem with multiple balancing requirements.
Computers & OR, 2009
Improving the operation of pipeline systems on cyclic structures by tabu search.
Computers & Chemical Engineering, 2009
Annals OR, 2009
Annals OR, 2008
The 10th anniversary special issue.
Efficient operation of natural gas transmission systems: A network-based heuristic for cyclic structures.
Computers & OR, 2006
Discrete bilevel programming: Application to a natural gas cash-out problem.
European Journal of Operational Research, 2005
Annals OR, 2005
A Hybrid Meta-heuristic Approach for Natural Gas Pipeline Network Optimization.
Proceedings of the Hybrid Metaheuristics, Second International Workshop, 2005
The Flow Shop Scheduling Polyhedron with Setup Time.
J. Comb. Optim., 2003
A Reduction Technique for Natural Gas Transmission Network Optimization Problems.
Annals OR, 2002
Optimizing fuel consumption on gas transmission networks: evaluation of a heuristic for cyclic systems.
Proceedings of the IEEE International Conference on Systems, 2001
An Enhanced TSP-Based Heuristic for Makespan Minimization in a Flow Shop with Setup Times.
J. Heuristics, 1999
Heuristics for the flow line problem with setup costs.
European Journal of Operational Research, 1998
Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
Computers & OR, 1998