| Artículo | 2024 | Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2024 | Bilevel optimization for the deployment of refuelling stations for electric vehicles on road networks | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2024 | Improved heuristics for solving large-scale Scanning Transmission Electron Microscopy image segmentation using the ordered median problem | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2024 | Intra-facility equity in discrete and continuous p-facility location problems | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2024 | Solving an Unrelated Parallel Machines Scheduling Problem with machine- and job-dependent setups and precedence constraints considering Support Machines | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2024 | The berth allocation and quay crane assignment problem with crane travel and setup times | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2023 | A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2023 | A multiple-drone arc routing and mothership coordination problem | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2023 | Facility location problems on graphs with non-convex neighborhoods | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2023 | Flowshop with additional resources during setups: mathematical models and a GRASP algorithm | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2023 | On clustering and interpreting with rules by means of mathematical optimization | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2023 | On optimal regression trees to detect critical intervals for multivariate functional data | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2023 | Solving the 1-median problem on a network with continuous demand and demand surplus | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2022 | A combinatorial optimization approach to scenario filtering in portfolio selection | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2022 | Benders decomposition for network design covering problems | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2022 | Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2022 | New efficient heuristics for scheduling open shops with makespan minimization | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2022 | Solving real-size stochastic railway rapid transit network construction scheduling problems | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2022 | The heterogeneous flexible periodic vehicle routing problem: mathematical formulations and solution algorithms | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2021 | A comparative study of different formulations for the capacitated discrete ordered median problem | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2021 | A robust optimization model for distribution network design under a mixed integer set of scenarios | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2021 | Coordinating drones with mothership vehicles: the mothership and drone routing problem with graphs | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2021 | On the multisource hyperplanes location problem to fitting set of points | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2021 | Optimal randomized classification trees | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2021 | Variable selection for Naïve Bayes classification | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2020 | A genetic algorithm for scheduling open shops with sequence-dependent setup times | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2020 | Clustering and portfolio selection problems: A unified framework | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2020 | Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2020 | Selection of time instants and intervals with Support Vector Regression for multivariate functional data | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2019 | A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2019 | A heuristic procedure for computing the nucleolus | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2019 | Cost-sensitive Feature Selection for Support Vector Machines | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2019 | Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2019 | Machine learning meets mathematical optimization to predict the optimal production of offshore wind parks | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2019 | New models for the location of controversial facilities: A bilevel programming approach | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2019 | Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2019 | Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2019 | The stratified p-center problem | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2018 | Genetic algorithms to optimize the operating costs of electricity and heating networks in buildings considering distributed energy generation and storage | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2018 | Locating hyperplanes to fitting set of points: A general framework | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2018 | Mathematical programming formulations for the efficient solution of the k-sum approval voting problem | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2017 | A beam-search-based constructive heuristic for the PFSP to minimise total flowtime | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2017 | A comparative study of formulations and solution methods for the discrete ordered p-median problem | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2017 | A minimum expected regret model for the shortest path problem with solution-dependent probability distributions | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2017 | An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2017 | An exact algorithm for Min-Max hyperstructure equipartition with a connected constraint | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2017 | Minmax regret combinatorial optimization problems with investments | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2017 | New approximate algorithms for the customer order scheduling problem with total completion time objective | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2017 | Reduction of permutation flowshop problems to single machine problems using machine dominance relations | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2017 | Solving multifacility Huff location models on networks using metaheuristic and exact approaches | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2017 | The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2017 | Visualizing proportions and dissimilarities by Space-filling maps: A Large Neighborhood Search approach | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2016 | Efficient constructive and composite heuristics for the Permutation Flowshop to minimise total earliness and tardiness | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2016 | Robust newsvendor problem with autoregressive demand | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2015 | A heuristic method for simultaneous tower and pattern-free field optimization on solar power systems | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2015 | A new set of high-performing heuristics to minimise flowtime in permutation flowshops | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2015 | Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2015 | Modelling and planning public cultural schedules for efficient use of resources | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2015 | NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2015 | When centers can fail: A close second opportunity | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2014 | A global optimisation approach for parameter estimation of a mixture of double Pareto lognormal and lognormal distributions | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2014 | A local search heuristic for the (r vertical bar p)-centroid problem in the plane | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2014 | A nested heuristic for parameter tuning in Support Vector Machines | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2014 | Exact formulations and algorithm for the train timetabling problem with dynamic demand | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2014 | Multi-instance classification through spherical separation and VNS | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2014 | On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2014 | rs-Sparse principal component analysis: A mixed integer nonlinear programming approach with VNS | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2013 | A geometric model for an effective rescheduling after reducing service in public transportation systems | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2013 | Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2013 | Finding the nucleolus of any n-person cooperative game by a single linear program | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2013 | Minimizing ordered weighted averaging of rational functions with applications to continuous location | COMPUTERS & OPERATIONS RESEARCH |
| Revisión | 2013 | Supervised classification and mathematical optimization | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2012 | A competing risks analysis of the duration of federal target funds rates | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2012 | A computational study of a nonlinear minsum facility location problem | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2012 | Gaussian variable neighborhood search for continuous optimization | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2011 | On minimax-regret Huff location models | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2011 | Single-allocation ordered median hub location problems | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2011 | Slacks-based measure of efficiency of airports with airplanes delays as undesirable outputs | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2010 | Finding an Euclidean anti-k-centrum location of a set of points | COMPUTERS & OPERATIONS RESEARCH |
| Revisión | 2010 | Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2010 | Setting a common due date in a constrained flowshop: A variable neighbourhood search approach | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2009 | A comparison of formulations and solution methods for the minimum-envy location problem | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2009 | Multiobjective target setting in data envelopment analysis using AHP | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2009 | Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics | COMPUTERS & OPERATIONS RESEARCH |
| Editorial | 2009 | Selected papers presented at the tenth International Symposium on Locational Decisions (ISOLDE X) Foreword | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2009 | The multi-period incremental service facility location problem | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2008 | A generalized model of equality measures in network location problems | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2008 | Dynamic supply chain design with inventory | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2008 | Locating a low-level waste disposal site | COMPUTERS & OPERATIONS RESEARCH |
| Editorial | 2008 | New trends in locational analysis | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2008 | Quasiconvex constrained multicriteria continuous location problems: Structure of nondominated solution sets | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2008 | Viral systems: A new bio-inspired optimisation approach | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2006 | An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2006 | Computing obnoxious 1-corner polygonal chains | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2006 | Data envelopment analysis of integer-valued inputs and outputs | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2006 | Exact procedures for solving the discrete ordered median problem | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2005 | Comparison of heuristics for flowtime minimisation in permutation flowshops | COMPUTERS & OPERATIONS RESEARCH |
| Artículo | 2002 | Locating stations on rapid transit lines | COMPUTERS & OPERATIONS RESEARCH |
