Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND
From MaRDI portal
(Redirected from Publication:6070871)
Recommendations
Cites work
- A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- A branch-and-price algorithm for the minimum latency problem
- A classification of formulations for the (time-dependent) traveling salesman problem
- A comparison of three metaheuristics for the workover rig routing problem
- A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
- A new formulation for the traveling deliveryman problem
- A simple and effective metaheuristic for the minimum latency problem
- A two-phase metaheuristic for the cumulative capacitated vehicle routing problem
- A unified solution framework for multi-attribute vehicle routing problems
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- An annotated bibliography of GRASP – Part I: Algorithms
- An annotated bibliography of GRASP-Part II: Applications
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- An integer programming approach for the time-dependent TSP
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
- Delaunay refinement algorithms for triangular mesh generation
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
- Facets and valid inequalities for the time-dependent travelling salesman problem
- Foundations of computational intelligence. Volume 3: Global optimization
- Greedy randomized adaptive search procedures
- Heuristics for the traveling repairman problem with profits
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 2079396 (Why is no real title available?)
- scientific article; zbMATH DE number 1507215 (Why is no real title available?)
- scientific article; zbMATH DE number 2102754 (Why is no real title available?)
- Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem
- Natural and extended formulations for the time-dependent traveling salesman problem
- Optimization by GRASP. Greedy randomized adaptive search procedures
- Polynomial formulation and heuristic based approach for the \(k\)-travelling repairman problem
- The \(k\)-traveling repairmen problem
- The complexity of the travelling repairman problem
- The Delivery Man Problem and Cumulative Matroids
- The delivery man problem with time windows
- The time dependent traveling salesman problem: polyhedra and algorithm
- TSPLIB—A Traveling Salesman Problem Library
- Variable neighborhood search
- Variable neighborhood search for the travelling deliveryman problem
This page was built for publication: Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6070871)
