The scientist’s investigation covers issues in Mathematical optimization, Heuristics, Upper and lower bounds, Algorithm and Operations research. Her Mathematical optimization research includes elements of Tree and GRASP. Her research investigates the connection between Heuristics and topics such as Heuristic that intersect with problems in Hybrid algorithm.
Her research investigates the connection with Algorithm and areas like Set which intersect with concerns in Heuristic. Her work on Facility location problem as part of general Operations research research is often related to Constructive, Arc routing and Ant colony, thus linking different fields of science. The Hub location problem study combines topics in areas such as Integer programming and Duality.
Elena Fernández mainly investigates Mathematical optimization, Integer programming, Upper and lower bounds, Set and Operations research. Her research on Mathematical optimization frequently connects to adjacent areas such as Algorithm. Her Linear programming relaxation study in the realm of Integer programming connects with subjects such as Network planning and design, Series, Service and Job shop scheduling.
She works mostly in the field of Relaxation, limiting it down to concerns involving Heuristic and, occasionally, Heuristics. Her biological study spans a wide range of topics, including Discrete mathematics, Spanning tree, Polyhedron, Special ordered set and Optimization problem. Elena Fernández has included themes like Path, GRASP and Extension in her Heuristic study.
Elena Fernández focuses on Mathematical optimization, Set, Integer programming, Branch and cut and Arc routing. Her work in Mathematical optimization is not limited to one particular discipline; it also encompasses Spanning tree. Her Spanning tree research is multidisciplinary, incorporating perspectives in Heuristics and Orders of magnitude.
Elena Fernández has researched Set in several fields, including Class, Algorithm, Branch and bound and Benchmark. Her research brings together the fields of Operations research and Integer programming. Her research integrates issues of Discrete mathematics, Vertex, Travelling salesman problem and Combinatorics in her study of Branch and cut.
Her primary areas of study are Mathematical optimization, Set, Integer programming, Operations research and Benchmark. Her work carried out in the field of Mathematical optimization brings together such families of science as Algorithm, Spanning tree and Extension. The various areas that Elena Fernández examines in her Set study include Graph, Combinatorics, Enhanced Data Rates for GSM Evolution, Branch and cut and Heuristic.
Her Integer programming research overlaps with other disciplines such as Customer collaboration, Service, Work, Vehicle routing problem and Order. Elena Fernández combines subjects such as Branch and bound, Class, Reduction, Tree and Lagrangian relaxation with her study of Benchmark.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
A compact model and tight bounds for a combined location-routing problem
Maria Albareda-Sambola;Juan A. Díaz;Elena Fernández.
Computers & Operations Research (2005)
Heuristic solutions to the problem of routing school buses with multiple objectives
Ángel Corberán;Elena Fernández;Manuel Laguna;Rafael Martí.
Journal of the Operational Research Society (2002)
A reactive GRASP for a commercial territory design problem with multiple balancing requirements
Roger Z. Ríos-Mercado;Elena Fernández.
Computers & Operations Research (2009)
A Tabu search heuristic for the generalized assignment problem
Juan A. Dı́az;Elena Fernández.
European Journal of Operational Research (2001)
REACTIVE GRASP AND TABU SEARCH BASED HEURISTICS FOR THE SINGLE SOURCE CAPACITATED PLANT LOCATION PROBLEM
Hugues Delmaire;Juan A. Díaz;Elena Fernández;Maruja Ortega.
The Tree of Hubs Location Problem
Iván A. Contreras;Elena Fernández;Alfredo Marín.
European Journal of Operational Research (2010)
Solving an urban waste collection problem using ants heuristics
Joaquín Bautista;Elena Fernández;Jordi Pereira.
Computers & Operations Research (2008)
General network design: A unified view of combined location and network design problems
Iván A. Contreras;Elena Fernández.
European Journal of Operational Research (2012)
HYBRID SCATTER SEARCH AND PATH RELINKING FOR THE CAPACITATED P-MEDIAN PROBLEM
Juan A. Díaz;Elena Fernández.
European Journal of Operational Research (2006)
Lagrangean relaxation for the capacitated hub location problem with single assignment
Iván A. Contreras;Juan A. Díaz;Elena Fernández.
OR Spectrum (2009)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: