Greedy randomized adaptive search procedures
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2050708
- Greedy randomized adaptive search procedures
- Parallel Greedy Randomized Adaptive Search Procedures
- Optimization by GRASP. Greedy randomized adaptive search procedures
- Greedy algorithms for adaptive approximation
- scientific article; zbMATH DE number 4029304
- Adaptive stochastic search
- Adaptive greedy approximations
- Adaptive approximations by greedy algorithms
- Greedy search of optimal approximate solutions
Cites work
- scientific article; zbMATH DE number 3898613 (Why is no real title available?)
- scientific article; zbMATH DE number 3550465 (Why is no real title available?)
- scientific article; zbMATH DE number 709816 (Why is no real title available?)
- scientific article; zbMATH DE number 714537 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 956862 (Why is no real title available?)
- A GRASP for a difficult single machine scheduling problem
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
- A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties
- A probabilistic heuristic for a computationally difficult set covering problem
- Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP
- An Efficient Heuristic Procedure for Partitioning Graphs
- An exact algorithm for the maximum clique problem
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- Computational results of an interior point algorithm for large scale linear programming
- Facility-Wide Planning and Scheduling of Printed Wiring Board Assembly
- Note—Operations Sequencing in Discrete Parts Manufacturing
- QAPLIB-A quadratic assignment problem library
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- Single machine scheduling to minimize weighted earliness subject to no tardy jobs
- Tabu Search—Part I
- Tabu Search—Part II
- The Fixed Job Schedule Problem with Spread-Time Constraints
- The Intermodal Trailer Assignment Problem
Cited in
(only showing first 100 items - show all)- A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
- Logic classification and feature selection for biomedical data
- Minimizing latency in post-disaster road clearance operations
- On some optimization problems in molecular biology
- A scatter search approach for the minimum sum-of-squares clustering problem
- The GLOBAL optimization method revisited
- Incremental bipartite drawing problem
- Scatter search for the cutwidth minimization problem
- Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem
- Applications of the DM‐GRASP heuristic: a survey
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem
- Efficient solutions for the far from most string problem
- Hybridization of GRASP metaheuristic with data mining techniques
- A quality and distance guided hybrid algorithm for the vertex separator problem
- GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
- A GRASP for the biquadratic assignment problem
- Honey bees mating optimization algorithm for large scale vehicle routing problems
- Revised GRASP with path-relinking for the linear ordering problem
- Randomized heuristics for the Max-Cut problem
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
- Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration
- A mathematical program to refine gene regulatory networks
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- An annotated bibliography of GRASP – Part I: Algorithms
- Inventory routing with continuous moves
- A hybrid heuristic algorithm for the open-pit-mining operational planning problem
- Tabu search and GRASP for the maximum diversity problem
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
- Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows
- Optimizing base station location and configuration in UMTS networks
- Heuristics and meta-heuristics for 2-layer straight line crossing minimization
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
- A variable neighborhood search approach for the vertex bisection problem
- A hybrid greedy randomized adaptive search heuristic to solve the dial-a-ride problem
- A GRASP for parallel machine scheduling with time windows
- Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- 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
- scientific article; zbMATH DE number 714537 (Why is no real title available?)
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
- Heuristics for the generalized median graph problem
- A biased random-key genetic algorithm for data clustering
- Hybrid metaheuristics: an introduction
- A nonmonotone GRASP
- The single period coverage facility location problem: Lagrangean heuristic and column generation approaches
- Using iterated local search for solving the flow-shop problem: parallelization, parametrization, and randomization issues
- A GRASP metaheuristic for microarray data analysis
- 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
- A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
- Power optimization in ad hoc wireless network topology control with biconnectivity requirements
- A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints
- 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
- Scatter search for an uncapacitated \(p\)-hub median problem
- Vector bin packing with heterogeneous bins: application to the machine reassignment problem
- Enhanced controlled tabular adjustment
- GRASP with evolutionary path-relinking for the capacitated arc routing problem
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
- Multi-neighborhood local search optimization for machine reassignment problem
- Load-dependent and precedence-based models for pickup and delivery problems
- A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems
- A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution
- GRASP with path-relinking for the generalized quadratic assignment problem
- Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling
- Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization
- Median and covering location problems with interconnected facilities
- A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs
- A reactive GRASP and path relinking for a combined production-distribution problem
- A survey on optimization metaheuristics
- New strategies for stochastic resource-constrained project scheduling
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
- A hybrid evolution strategy for the open vehicle routing problem
- GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- GRASP and path relinking for the matrix bandwidth minimization.
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs
- A GRASP heuristic for the mixed Chinese postman problem
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems
- A new dominance rule to minimize total weighted tardiness with unequal release dates.
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem
- A review of recent advances in global optimization
- Variable neighborhood search for the degree-constrained minimum spanning tree problem
- Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations
- Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- The \(p\)-median problem: a survey of metaheuristic approaches
- Algorithms for the design of network topologies with balanced disjoint rings
- Scatter search for network design problem
This page was built for publication: Greedy randomized adaptive search procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804580)
