Greedy randomized adaptive search procedures

DOI10.1007/BF01096763zbMath0822.90110OpenAlexW2997776631MaRDI QIDQ1804580

Mauricio G. C. Resende, Thomas A. Feo

Publication date: 15 May 1995

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01096763

zbMATH Keywords

heuristic computer implementation greedy randomized adaptive search procedures iterative randomized sampling technique

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Improved solutions to the Steiner triple covering problem, A survey of recent research on location-routing problems, A combinatorial algorithm for the TDMA message scheduling problem, Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers, Evolution of the population of a genetic algorithm using particle swarm optimization: application to clustering analysis, Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP, A three-phased local search approach for the clique partitioning problem, A review of recent advances in global optimization, Solving a $k$-node minimum label spanning arborescence problem to compress fingerprint templates, Decomposition based hybrid metaheuristics, Network repair crew scheduling and routing for emergency relief distribution problem, An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints, Integer programming models for feature selection: new extensions and a randomized solution algorithm, Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks, A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem, Heuristics for the generalized median graph problem, A survey for the quadratic assignment problem, A hybrid approach for the vehicle routing problem with three-dimensional loading constraints, A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling, A GRASP metaheuristic for microarray data analysis, A hybrid Lagrangean heuristic with GRASP and path-relinking for set $k$-covering, Tabu search and GRASP for the maximum diversity problem, A hybrid data mining GRASP with path-relinking, A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem, Power optimization in ad hoc wireless network topology control with biconnectivity requirements, GRASP with evolutionary path-relinking for the capacitated arc routing problem, GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem, A redistricting problem applied to meter reading in power distribution networks, A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction, GRASP for the uncapacitated $r$-allocation $p$-hub median problem, Enhanced controlled tabular adjustment, Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem, A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints, The production routing problem: a review of formulations and solution algorithms, Scatter search for an uncapacitated $p$-hub median problem, A heuristic algorithm for a supply chain's production-distribution planning, A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading, Inventory routing with continuous moves, Heuristics for matrix bandwidth reduction, Vector bin packing with heterogeneous bins: application to the machine reassignment problem, On double cycling for container port productivity improvement, A nonmonotone GRASP, Load-dependent and precedence-based models for pickup and delivery problems, Multi-neighborhood local search optimization for machine reassignment problem, The constrained shortest path tour problem, The dynamic vehicle allocation problem with application in trucking companies in Brazil, Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking, Optimizing base station location and configuration in UMTS networks, Heuristics for the mirrored traveling tournament problem, A tabu search approach for solving a difficult forest harvesting machine location problem, The $p$-median problem: a survey of metaheuristic approaches, On the number of local minima for the multidimensional assignment problem, Short-term work scheduling with job assignment flexibility for a multi-fleet transport system, Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem, A reactive GRASP and path relinking for a combined production-distribution problem, A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem, The single period coverage facility location problem: Lagrangean heuristic and column generation approaches, Evolutionary optimization: pitfalls and booby traps, Efficient frameworks for greedy split and new depth first search split procedures for routing problems, Multi-depot vessel routing problem in a direction dependent wavefield, A guided reactive GRASP for the capacitated multi-source Weber problem, Heuristic and exact algorithms for a min-max selective vehicle routing problem, Revised GRASP with path-relinking for the linear ordering problem, Hybridized evolutionary local search algorithm for the team orienteering problem with time windows, Coalition structure generation: a survey, Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem, A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems, A GRASP with evolutionary path relinking for the truck and trailer routing problem, Heuristics for a project management problem with incompatibility and assignment costs, A benchmark library and a comparison of heuristic methods for the linear ordering problem, A GRASP based on DE to solve single machine scheduling problem with SDST, Similarities between meta-heuristics algorithms and the science of life, Exact and heuristic solutions to minimize total waiting time in the blood products distribution problem, A hybrid ACO-GRASP algorithm for clustering analysis, A fast algorithm for robust regression with penalised trimmed squares, Seeking global edges for traveling salesman problem in multi-start search, Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility, A GRASP metaheuristic for the robust mapping and routing of dataflow process networks on manycore architectures, A survey on optimization metaheuristics, GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem, An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation, Heuristics and lower bounds for minimizing fuel consumption in hybrid-electrical vehicles, A simple greedy heuristic for linear assignment interdiction, Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs, Scatter search for the bandpass problem, Experiments with LAGRASP heuristic for set $k$-covering, Restart strategies for GRASP with path-relinking heuristics, Local search for the undirected capacitated arc routing problem with profits, Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms, A reactive GRASP with path relinking for capacitated clustering, Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem, A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times, Continuous GRASP with a local active-set method for bound-constrained global optimization, A Metropolis algorithm combined with Hooke-Jeeves local search method applied to global optimization, A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution, GRASP with path-relinking for the generalized quadratic assignment problem, Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems, Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization, Scatter search for network design problem, Metaheuristics in combinatorial optimization, Hybrid simulated annealing with memory: an evolution-based diversification approach, Optimization in Designing Complex Communication Networks, Discrete facility location in machine learning, Hybrid Metaheuristics: An Introduction, Hybridizations of Metaheuristics With Branch & Bound Derivates, Responsive make‐to‐order supply chain network design, Modeling and solving the endpoint cutting problem, On the role of metaheuristic optimization in bioinformatics, Initialization of metaheuristics: comprehensive review, critical analysis, and research directions, An efficient heuristic for the $k$-partitioning problem, The multifacility center problems with random demand weights, A critical analysis of the “improved Clarke and Wright savings algorithm”, A hybrid heuristic approach to minimize number of tardy jobs in group technology systems, An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem, A matheuristic for the firefighter problem on graphs, Heuristics for the capacitated dispersion problem, Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND, Solving the clustered traveling salesman problem with ‐relaxed priority rule, Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining, Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem, A heuristic for the convex recoloring problem in graphs, GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows, A mixed‐integer linear programming model and a metaheuristic approach for the selection and allocation of land parcels problem, An inventory hub location model for multi‐coal‐fired coastal power plants: a case study in Guangdong district, The two‐echelon routing problem with truck and drones, Program trace optimization with constructive heuristics for combinatorial problems, Research trends in combinatorial optimization, Exact Solution Algorithms for the Chordless Cycle Problem, Metaheuristics: A Canadian Perspective, A matheuristic for the electric vehicle routing problem with time windows and a realistic energy consumption model, Efficient iterated greedy for the two-dimensional bandwidth minimization problem, Flowshop with additional resources during setups: mathematical models and a GRASP algorithm, Fixed set search applied to the clique partitioning problem, Mobility offer allocations in corporate settings, Solving Dynamic Vehicle Routing Problem with Soft Time Window by iLNS and hPSO, Heuristic Ranking Classification Method for Complex Large-Scale Survival Data, A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem, Local Search Based on Genetic Algorithms, An enhanced GRASP approach for the index tracking problem, A Branch Decomposition Algorithm for the p-Median Problem, Exact and heuristic solutions for the prize‐collecting geometric enclosure problem, Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window, Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem, Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows, A mathematical model for human papillomavirus vaccination strategies in a random network, Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem, Intelligent water drops algorithm, Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Mobile base stations location problem to fortification against natural disasters: A fuzzy approach, Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis, Applications of the DM‐GRASP heuristic: a survey, Effective heuristics for the Set Covering with Pairs Problem, A GRASP algorithm for a capacitated, fixed charge, multicommodity network flow problem with uncertain demand and survivability constraints, Correspondence of projected 3-D points and lines using a continuous GRASP, Models and heuristics for the k ‐degree constrained minimum spanning tree problem with node‐degree costs, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Multi-start approach for an integer determinant maximization problem, Metaheuristics for computing the forwarding index of a graph*, A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure, A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM, Approximate solutions to the turbine balancing problem., Probabilistic stopping rules for GRASP heuristics and extensions, Improved heuristics for the regenerator location problem, Analysis and design of peer‐assisted video‐on‐demand services, Variable neighborhood search: Principles and applications, Randomized heuristics for the Max-Cut problem, A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness, A new dominance rule to minimize total weighted tardiness with unequal release dates., Reducing the bandwidth of a sparse matrix with tabu search., A Meta-RaPS for the early/tardy single machine scheduling problem, Adaptive memory programming: a unified view of metaheuristics, Incremental bipartite drawing problem, A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems, Scheduling issues in vehicle routing, A hybrid data mining metaheuristic for the p‐median problem, An efficient exact approach for the constrained shortest path tour problem, A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem, Improved starting solutions for the planar p-median problem, The ALGACEA‐1 method for the capacitated vehicle routing problem, VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH, Randomized heuristics for the family traveling salesperson problem, Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues, Unnamed Item, The capacitated m two node survivable star problem, The minimum cut cover problem, An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem, Toward unification of exact and heuristic optimization methods, Evolutionary algorithms applied to project scheduling problems—a survey of the state-of-the-art, An approach for efficient ship routing, A Hybrid Metaheuristic for Routing on Multicast Networks, Adaptive Tunning of All Parameters in a Multi-Swarm Particle Swarm Optimization Algorithm: An Application to the Probabilistic Traveling Salesman Problem, New strategies for stochastic resource-constrained project scheduling, A crane scheduling method for port container terminals, Heuristics for the constrained incremental graph drawing problem, Variable neighborhood search for the degree-constrained minimum spanning tree problem, Detecting robust cliques in graphs subject to uncertain edge failures, Computational aspects of the maximum diversity problem, A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times, An iterated ``hyperplane exploration approach for the quadratic knapsack problem, Intelligent-guided adaptive search for the maximum covering location problem, GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem, A quality and distance guided hybrid algorithm for the vertex separator problem, Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign, Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times, Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties, Bi-objective orienteering for personal activity scheduling, A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment, Carousel greedy: a generalized greedy algorithm with applications in optimization, Computational study of valid inequalities for the maximum $k$-cut problem, Solving large-scale TSP using a fast wedging insertion partitioning approach, Metaheuristics: A bibliography, Designing and reporting on computational experiments with heuristic methods, A simple and effective metaheuristic for the minimum latency problem, Fuzzy optimization for distribution of frozen food with imprecise times, Minimum energy target tracking with coverage guarantee in wireless sensor networks, A minimax assignment problem in treelike communication networks, Optimal location of RFID reader antennas in a three dimensional space, Evaluating balancing on social networks through the efficient solution of correlation clustering problems, A GRASP heuristic for the manufacturing cell formation problem, Variable neighborhood scatter search for the incremental graph drawing problem, A batch-oblivious approach for complex job-shop scheduling problems, A cluster-first route-second approach for the swap body vehicle routing problem, Partitioning of supply/demand graphs with capacity limitations: an ant colony approach, A constraint programming approach to the additional relay placement problem in wireless sensor networks, GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times, Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem, A variable neighborhood search for graph coloring., MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems, GRASP and path relinking for the matrix bandwidth minimization., GRASP for set packing problems., Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP, A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics, Solving the capacitated location-routing problem. Abstract of Thesis, GRASP and VNS for solving the $p$-next center problem, Logic classification and feature selection for biomedical data, Facility location for market capture when users rank facilities by shorter travel and waiting times, An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports, A GRASP algorithm for solving large-scale single row facility layout problems, Scatter search for the single source capacitated facility location problem, A GRASP algorithm for the multi-criteria minimum spanning tree problem, Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem, The GLOBAL optimization method revisited, Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times, Median and covering location problems with interconnected facilities, Minimizing latency in post-disaster road clearance operations, A matheuristic for the cell formation problem, A hybrid stochastic genetic-GRASP algorithm for clustering analysis, Design of hybrids for the minimum sum-of-squares clustering problem, A reactive GRASP for a commercial territory design problem with multiple balancing requirements, An iterated greedy heuristic for a market segmentation problem with multiple attributes, A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems, Sequential testing of $n$-out-of-$n$ systems: precedence theorems and exact methods, A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem, Scatter search for the cutwidth minimization problem, Efficient solutions for the far from most string problem, An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem, A GRASP algorithm for the closest string problem using a probability-based heuristic, Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction, Honey bees mating optimization algorithm for large scale vehicle routing problems, A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions, A GRASP$\times $ELS approach for the capacitated location-routing problem, Speeding up continuous GRASP, Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration, Industrial aspects and literature survey: fleet composition and routing, A hybrid heuristic algorithm for the open-pit-mining operational planning problem, Hybrid VNS heuristics for the production scheduling of costumes for Brazilian carnival samba schools, The multiple traveling salesman problem with backup coverage, A route set construction algorithm for the transit network design problem, Analysis of new variable selection methods for discriminant analysis, Developing work schedules for an inter-city transit system with multiple driver types and fleet types, The equitable dispersion problem, Guided local search and its application to the traveling salesman problem, Heuristics and meta-heuristics for 2-layer straight line crossing minimization, A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem., Heuristics for the bi-objective path dissimilarity problem, A mathematical program to refine gene regulatory networks, Solving systems of nonlinear equations with continuous GRASP, Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem, Randomized parallel algorithms for the multidimensional assignment problem, The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations, A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem, A hybrid evolution strategy for the open vehicle routing problem, GRASP and path relinking for the max-min diversity problem, A cross entropy based algorithm for reliability problems, Using a greedy random adaptative search procedure to solve the cover printing problem, A GRASP for the biquadratic assignment problem, GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem, A GRASP heuristic for the mixed Chinese postman problem, Diversification strategies in local search for a nonbifurcated network loading problem, Heuristics for the flow line problem with setup costs, A fuzzy genetic algorithm for driver scheduling, A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem, ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms, A branch-and-price algorithm for the ring-tree facility location problem, A GRASP for the convex recoloring problem in graphs, Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach, Problems of discrete optimization: challenges and main approaches to solve them, Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP, Multiobjective GRASP with path relinking, A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem, Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling, Assembly line balancing: what happened in the last fifteen years?, A hybrid variable neighborhood search algorithm for targeted offers in direct marketing, A web-based decision support system for waste lube oils collection and recycling, Variable neighbourhood search for bandwidth reduction, Logic based methods for SNPs tagging and reconstruction, New formulations and solution approaches for the latency location routing problem, A greedy randomized adaptive search procedure (GRASP) for the multi-vehicle prize collecting arc routing for connectivity problem, A multi-objective model for environmental investment decision making, Packing items to feed assembly lines, Local search-based hybrid algorithms for finding Golomb rulers, An efficient GRASP algorithm for disassembly sequence planning, On some optimization problems in molecular biology, A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines, Multi-machine energy-aware scheduling, A metaheuristic algorithm for ship weather routing, A heuristic approach for dividing graphs into bi-connected components with a size constraint, Integration of routing into a resource-constrained project scheduling problem, A review of vehicle routing with simultaneous pickup and delivery, Efficient approaches for the flooding problem on graphs, Mathematical models to improve the current practice in a home healthcare unit, The secure time-dependent vehicle routing problem with uncertain demands, Large-scale periodic scheduling in time-sensitive networks, A review on discrete diversity and dispersion maximization from an OR perspective, The leader multipurpose shopping location problem, Computational study of a branching algorithm for the maximum $k$-cut problem, A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem, A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics, A min-max regret approach to maximum likelihood inference under incomplete data, Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences, Mathematical formulations and solution methods for the uncapacitated $r$-allocation $p$-hub maximal covering problem, A variable neighborhood search approach for the vertex bisection problem, Bayesian stopping rules for greedy randomized procedures, A biased random-key genetic algorithm for data clustering, Improvements to MCS algorithm for the maximum clique problem, Adaptive memory programming for the robust capacitated international sourcing problem, Global optimization by continuous grasp, Optimal placement of stereo sensors, A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs, Balancing and scheduling tasks in assembly lines with sequence-dependent setup times, Multiobjective optimization for complex flexible job-shop scheduling problems, RAMP algorithms for the capacitated facility location problem, Finding efficient make-to-order production and batch delivery schedules, Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art, An efficient variable neighborhood search for the space-free multi-row facility layout problem, Solving the wire-harness design problem at a European car manufacturer, Optimal control in citrus diseases, Local search with perturbations for the prize-collecting Steiner tree problem in graphs, Speeding up branch and bound algorithms for solving the maximum clique problem, Cutting ellipses from area-minimizing rectangles, Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics, Bilevel optimization applied to strategic pricing in competitive electricity markets, Embedding signed graphs in the line, A multi-objective GRASP procedure for reactive power compensation planning, Emergency response in natural disaster management: allocation and scheduling of rescue units, Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations, A multi-product production/distribution system design problem with direct shipments and lateral transshipments, A scatter search approach for the minimum sum-of-squares clustering problem, Expanding neighborhood GRASP for the traveling salesman problem, Minimizing labor requirements in a periodic vehicle loading problem, Algorithms for the design of network topologies with balanced disjoint rings, GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem, Metaheuristic algorithms for the hybrid flowshop scheduling problem, GRASP with variable neighborhood descent for the online order batching problem, Revenue maximization of Internet of things provider using variable neighbourhood search, Hybridization of GRASP metaheuristic with data mining techniques, Joint optimization of container slot planning and truck scheduling for tandem quay cranes, A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows, A greedy randomized adaptive search procedure for the orienteering problem with hotel selection, Recursive circle packing problems, A metaheuristic for the delivery man problem with time windows, Hybridizations of GRASP with path relinking for the far from most string problem, Data-Mining-Driven Neighborhood Search, Loading tow trains ergonomically for just-in-time part supply, Speeding up MCS Algorithm for the Maximum Clique Problem with ILS Heuristic and Other Enhancements, GRASP with Path-Relinking for Facility Layout, $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices, A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem, On location-allocation problems for dimensional facilities, An infeasible space exploring matheuristic for the production routing problem, Exact and heuristic algorithms for the maximum weighted submatrix coverage problem, Two-echelon vehicle routing problems: a literature review, A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems, Analysis of properties of quantum hashing, Hybrid algorithms for placement of virtual machines across geo-separated data centers, Hybrid scatter search and path relinking for the capacitated $p$-median problem, A GRASP and path relinking heuristic for rural road network development, Memetic algorithms, Towards an efficient resolution of printing problems, An efficient GRASP-like algorithm for the multi-product straight pipeline scheduling problem, A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning

Uses Software

DIMACS

Cites Work