scientific article; zbMATH DE number 2050708
From MaRDI portal
Publication:4452897
zbMATH Open1102.90384MaRDI QIDQ4452897FDOQ4452897
Mauricio G. C. Resende, Celso C. Ribeiro
Publication date: 7 March 2004
Title of this publication is not available (Why is that?)
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Randomized algorithms (68W20) Integer programming (90C10)
Cited In (only showing first 100 items - show all)
- Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
- Iterated greedy for the maximum diversity problem
- A biased random-key genetic algorithm for data clustering
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem
- Solving the vehicle routing problem with adaptive memory programming methodology
- A hybrid multistart heuristic for the uncapacitated facility location problem
- A review of hyper-heuristics for educational timetabling
- An annotated bibliography of GRASP – Part I: Algorithms
- GRASP for set packing problems.
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
- Location-arc routing problem: heuristic approaches and test instances
- A survey of search methodologies and automated system development for examination timetabling
- Heuristics for the mirrored traveling tournament problem
- Region-rejection based heuristics for the capacitated multi-source Weber problem
- A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
- A tabu search approach for solving a difficult forest harvesting machine location problem
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
- Emergency response in natural disaster management: allocation and scheduling of rescue units
- A route set construction algorithm for the transit network design problem
- Speeding up continuous GRASP
- Container sequencing for quay cranes with internal reshuffles
- A survey on optimization metaheuristics
- Stability evaluation of a railway timetable at station level
- Heuristics for the generalized median graph problem
- Orienteering problem: a survey of recent variants, solution approaches and applications
- Capacitated \(m\) two-node survivable star problem
- Generalized route planning model for hazardous material transportation with VaR and equity considerations
- Branch and bound for the cutwidth minimization problem
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Reactive GRASP for the strip-packing problem
- Balancing and scheduling tasks in assembly lines with sequence-dependent setup times
- Expanding neighborhood GRASP for the traveling salesman problem
- The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics
- A combinatorial algorithm for the TDMA message scheduling problem
- Optimal placement of stereo sensors
- A GRASP algorithm to solve the unicost set covering 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
- GRASP and path relinking for the equitable dispersion problem
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
- The synchronized arc and node routing problem: application to road marking
- Power optimization in ad hoc wireless network topology control with biconnectivity requirements
- Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics
- Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling
- A hybrid heuristic for the diameter constrained minimum spanning tree problem
- A path-relinking approach for a bi-criteria disassembly sequencing problem
- Heuristics for the bi-objective path dissimilarity problem
- Title not available (Why is that?)
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
- Tabu search and GRASP for the maximum diversity problem
- A particle swarm optimization algorithm with path relinking for the location routing problem
- Greedy randomized adaptive search procedures
- GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem
- Logic classification and feature selection for biomedical data
- GRASP and path relinking for the max-min diversity problem
- GRASP with path-relinking for the generalized quadratic assignment problem
- A GRASP-based approach for technicians and interventions scheduling for telecommunications
- Honey bees mating optimization algorithm for large scale vehicle routing problems
- A mathematical program to refine gene regulatory networks
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
- Using scenario trees and progressive hedging for stochastic inventory routing problems
- GRASP: An annoted bibliography
- Probability distribution of solution time in GRASP: an experimental investigation
- A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
- An improved ant colony optimisation heuristic for graph colouring
- Some heuristic methods for solving \(p\)-median problems with a coverage constraint
- Scatter search for the cutwidth minimization problem
- Variable neighbourhood search for the minimum labelling Steiner tree problem
- Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- A multi-threaded local search algorithm and computer implementation for the multi-mode, resource-constrained multi-project scheduling problem
- TTT plots: a perl program to create time-to-target plots
- Algorithms for the design of network topologies with balanced disjoint rings
- Ant colony system for a dynamic vehicle routing problem
- Multiobjective GRASP with path relinking
- Algorithms for single machine total tardiness scheduling with sequence dependent setups
- Title not available (Why is that?)
- An efficient metaheuristic to improve accessibility by rural road network planning
- A hybrid stochastic genetic-GRASP algorithm for clustering analysis
- Efficient algorithms for cluster editing
- Parallel Greedy Randomized Adaptive Search Procedures
- Bayesian stopping rules for greedy randomized procedures
- Embedding signed graphs in the line
- PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems
- Multi-depot vessel routing problem in a direction dependent wavefield
- On the incorporation of adversarial reasoning in course of action analysis and resource allocation
- 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
- Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications
- Towards an efficient resolution of printing problems
- A GRASP algorithm for solving large-scale single row facility layout problems
- Tabu search for the dynamic bipartite drawing problem
- Scatter search --- wellsprings and challenges
- A GRASP and path relinking heuristic for rural road network development
- A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem
- Bubblesearch: a simple heuristic for improving priority-based greedy algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452897)
