Pages that link to "Item:Q1804580"

The following pages link to Greedy randomized adaptive search procedures (Q1804580):

Displaying 50 items.

• Intelligent-guided adaptive search for the maximum covering location problem (Q1652063) (← links)
• GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem (Q1652080) (← links)
• A quality and distance guided hybrid algorithm for the vertex separator problem (Q1652081) (← links)
• Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign (Q1652137) (← links)
• Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times (Q1652166) (← links)
• Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties (Q1652242) (← links)
• Bi-objective orienteering for personal activity scheduling (Q1652268) (← links)
• A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment (Q1652330) (← links)
• Carousel greedy: a generalized greedy algorithm with applications in optimization (Q1652355) (← links)
• Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
• Solving large-scale TSP using a fast wedging insertion partitioning approach (Q1666767) (← links)
• Minimum energy target tracking with coverage guarantee in wireless sensor networks (Q1681141) (← links)
• Optimal location of RFID reader antennas in a three dimensional space (Q1686531) (← links)
• Evaluating balancing on social networks through the efficient solution of correlation clustering problems (Q1688940) (← links)
• Variable neighborhood scatter search for the incremental graph drawing problem (Q1694406) (← links)
• A batch-oblivious approach for complex job-shop scheduling problems (Q1695012) (← links)
• A cluster-first route-second approach for the swap body vehicle routing problem (Q1695789) (← links)
• Partitioning of supply/demand graphs with capacity limitations: an ant colony approach (Q1698074) (← links)
• Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem (Q1701982) (← links)
• A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics (Q1718582) (← links)
• GRASP and VNS for solving the \(p\)-next center problem (Q1725619) (← links)
• An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports (Q1730615) (← links)
• A GRASP algorithm for solving large-scale single row facility layout problems (Q1734823) (← links)
• Median and covering location problems with interconnected facilities (Q1738812) (← links)
• Minimizing latency in post-disaster road clearance operations (Q1740563) (← links)
• Parametrized GRASP heuristics for three-index assignment (Q1742603) (← links)
• A matheuristic for the cell formation problem (Q1744631) (← links)
• An iterated greedy heuristic for a market segmentation problem with multiple attributes (Q1753559) (← links)
• A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems (Q1753628) (← links)
• Sequential testing of \(n\)-out-of-\(n\) systems: precedence theorems and exact methods (Q1755382) (← links)
• Scatter search for the cutwidth minimization problem (Q1761768) (← links)
• Efficient solutions for the far from most string problem (Q1761847) (← links)
• An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem (Q1761902) (← links)
• A GRASP algorithm for the closest string problem using a probability-based heuristic (Q1761970) (← links)
• Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction (Q1762010) (← links)
• Hybrid VNS heuristics for the production scheduling of costumes for Brazilian carnival samba schools (Q1791903) (← links)
• The multiple traveling salesman problem with backup coverage (Q1791936) (← links)
• Guided local search and its application to the traveling salesman problem (Q1808420) (← links)
• Heuristics and meta-heuristics for 2-layer straight line crossing minimization (Q1811085) (← links)
• A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. (Q1811625) (← links)
• Semi-greedy heuristics: An empirical study (Q1821033) (← links)
• Randomized parallel algorithms for the multidimensional assignment problem (Q1826608) (← links)
• A GRASP heuristic for the mixed Chinese postman problem (Q1847247) (← links)
• Diversification strategies in local search for a nonbifurcated network loading problem (Q1848356) (← links)
• Probability distribution of solution time in GRASP: an experimental investigation (Q1850990) (← links)
• A fuzzy genetic algorithm for driver scheduling (Q1869717) (← links)
• A crane scheduling method for port container terminals (Q1877918) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Designing and reporting on computational experiments with heuristic methods (Q1922625) (← links)
• A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)