scientific article; zbMATH DE number 2050708

Mauricio G. C. Resende, Celso Carneiro Ribeiro

Publication date: 7 March 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Integer programming (90C10) Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Randomized algorithms (68W20)

Related Items (only showing first 100 items - show all)

An efficient metaheuristic to improve accessibility by rural road network planning ⋮ Multiobjective GRASP with path relinking ⋮ Variable neighbourhood search for the \(k\)-labelled spanning forest problem ⋮ An Integer Programming Formulation for the Maximum k-Subset Intersection Problem ⋮ Computing Minimum Dilation Spanning Trees in Geometric Graphs ⋮ A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing ⋮ Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem ⋮ Neighborhood decomposition-driven variable neighborhood search for capacitated clustering ⋮ Using horizontal cooperation concepts in integrated routing and facility‐location decisions ⋮ A robust P2P streaming architecture and its application to a high quality live-video service ⋮ A quadratic simplex algorithm for primal optimization over zero-one polytopes ⋮ Bayesian stopping rules for greedy randomized procedures ⋮ A biased random-key genetic algorithm for data clustering ⋮ Global optimization by continuous grasp ⋮ A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm ⋮ Optimal placement of stereo sensors ⋮ Balancing and scheduling tasks in assembly lines with sequence-dependent setup times ⋮ TTT plots: a perl program to create time-to-target plots ⋮ An improved ant colony optimisation heuristic for graph colouring ⋮ A particle swarm optimization algorithm with path relinking for the location routing problem ⋮ GRASP and path relinking for project scheduling under partially renewable resources ⋮ Expanding neighborhood GRASP for the traveling salesman problem ⋮ Maximizing breaks and bounding solutions to the mirrored traveling tournament problem ⋮ Improving Cutting-Stock Plans with Multi-objective Genetic Algorithm ⋮ Efficient algorithms for cluster editing ⋮ Dependable virtual network mapping ⋮ A hybrid data mining metaheuristic for the p‐median problem ⋮ Global Optimization for 2D SLAM Problem ⋮ Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications ⋮ 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 ⋮ Ant colony system for a dynamic vehicle routing problem ⋮ Applying multiple objective tabu search to continuous optimization problems with a simple neighbourhood strategy ⋮ Quadratic bottleneck knapsack problems ⋮ A review of hyper-heuristics for educational timetabling ⋮ Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach ⋮ A GRASP approach for the extended car sequencing problem ⋮ A survey of search methodologies and automated system development for examination timetabling ⋮ A combinatorial algorithm for the TDMA message scheduling problem ⋮ 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 ⋮ Stability evaluation of a railway timetable at station level ⋮ Making a state-of-the-art heuristic faster with data mining ⋮ Logic based methods for SNPs tagging and reconstruction ⋮ 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 ⋮ Packing items to feed assembly lines ⋮ Local search-based hybrid algorithms for finding Golomb rulers ⋮ The synchronized arc and node routing problem: application to road marking ⋮ A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems ⋮ GRASP and path relinking for the equitable dispersion problem ⋮ Probabilistic GRASP-tabu search algorithms for the UBQP problem ⋮ 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 path relinking for the symmetric Euclidean clustered traveling salesman problem ⋮ Generalized route planning model for hazardous material transportation with VaR and equity considerations ⋮ Location-arc routing problem: heuristic approaches and test instances ⋮ Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics ⋮ Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling ⋮ The Boolean quadratic programming problem with generalized upper bound constraints ⋮ A hybrid multistart heuristic for the uncapacitated facility location problem ⋮ Tabu search for the dynamic bipartite drawing problem ⋮ Branch and bound for the cutwidth minimization problem ⋮ Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking ⋮ Heuristics for the mirrored traveling tournament problem ⋮ A tabu search approach for solving a difficult forest harvesting machine location problem ⋮ Evolution-inspired local improvement algorithm solving orienteering problem ⋮ Solving large-scale TSP using a fast wedging insertion partitioning approach ⋮ A GRASP algorithm to solve the unicost set covering problem ⋮ Two-machine flow shop problems with a single server ⋮ Some heuristic methods for solving \(p\)-median problems with a coverage constraint ⋮ A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing ⋮ PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems ⋮ Multi-depot vessel routing problem in a direction dependent wavefield ⋮ The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics ⋮ A guided reactive GRASP for the capacitated multi-source Weber problem ⋮ 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 ⋮ Algorithms for single machine total tardiness scheduling with sequence dependent setups ⋮ GRASP for set packing problems. ⋮ A hybrid ACO-GRASP algorithm for clustering analysis ⋮ A path-relinking approach for a bi-criteria disassembly sequencing problem ⋮ Logic classification and feature selection for biomedical data ⋮ A GRASP heuristic for slab scheduling at continuous casters ⋮ A GRASP algorithm for solving large-scale single row facility layout problems ⋮ Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem ⋮ Reactive GRASP for the strip-packing problem ⋮ A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives ⋮ A survey on optimization metaheuristics ⋮ A hybrid stochastic genetic-GRASP algorithm for clustering analysis ⋮ Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure ⋮ A multi-threaded local search algorithm and computer implementation for the multi-mode, resource-constrained multi-project scheduling problem ⋮ Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles ⋮ On the incorporation of adversarial reasoning in course of action analysis and resource allocation ⋮ Restart strategies for GRASP with path-relinking heuristics

This page was built for publication: