scientific article
From MaRDI portal
Publication:2731676
zbMath0983.90077MaRDI QIDQ2731676
Rafael Martí, Manuel Laguna, Fred Glover
Publication date: 29 July 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Matheuristics: survey and synthesis, Algorithm unions for solving discrete optimization problems, Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem, Metaheuristics: A Canadian Perspective, Exact and heuristic solutions for the prize‐collecting geometric enclosure problem, Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands, An Experimental Comparison of Algebraic Crossover Operators for Permutation Problems, Simulation optimization: a review of algorithms and applications, A project portfolio selection problem in a group decision-making context, Hybrid evolutionary search for the minimum sum coloring problem of graphs, \(f\)-flip strategies for unconstrained binary quadratic programming, The linear ordering problem with clusters: a new partial ranking, A scatter search algorithm for the distributed permutation flowshop scheduling problem, Clustered enhanced differential evolution for the blocking flow shop scheduling problem, Metaheuristics for solving a multimodal home-healthcare scheduling problem, Multi-neighborhood based path relinking for two-sided assembly line balancing problem, Finding local optima of high-dimensional functions using direct search methods, Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder, Making a state-of-the-art heuristic faster with data mining, Decomposition based hybrid metaheuristics, Solving two location models with few facilities by using a hybrid heuristic: a real health resources case, New heuristic algorithms for the windy rural postman problem, A GRASP metaheuristic for microarray data analysis, A hybrid data mining GRASP with path-relinking, Power optimization in ad hoc wireless network topology control with biconnectivity requirements, Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem, Scatter search for an uncapacitated \(p\)-hub median problem, A path-relinking algorithm for the multi-mode resource-constrained project scheduling problem, GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem, Experimental investigation of heuristics for resource-constrained project scheduling: an update, A hybrid multistart heuristic for the uncapacitated facility location problem, Hybrid method with CS and BRKGA applied to the minimization of tool switches problem, A hybrid three-phase approach for the Max-Mean dispersion problem, Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items, A tabu search based memetic algorithm for the Max-Mean dispersion problem, The \(p\)-median problem: a survey of metaheuristic approaches, Robust min-max regret covering problems, A hybrid meta-heuristic for the batching problem in just-in-time flow shops, Three-phase methodology incorporating scatter search for integrated production, inventory, and distribution routing problem, A scatter search algorithm for time-dependent prize-collecting arc routing problems, A hybrid metaheuristic approach to solving the UBQP problem, Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization, A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization, Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel, Using resource scarceness characteristics to solve the multi-mode resource-constrained project scheduling problem, An evolutionary approach for the nurse rerostering problem, Heuristics for urban road network design: lane layout and signal settings, The Vehicle Routing Problem with Release and Due Dates, An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem, Vehicle routing with compartments: applications, modelling and heuristics, Soft car sequencing with colors: lower bounds and optimality proofs, Artificial life techniques for load balancing in computational grids, A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem, A multiobjective model for forest planning with adjacency constraints, Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges, The development of a multi-objective tabu search algorithm for continuous optimisation problems, Parallel metaheuristics for workforce planning, Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup, A multi-objective capacitated rural school bus routing problem with heterogeneous fleet and mixed loads, A bi-objective reverse logistics network analysis for post-sale service, Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem, A multi-objective scatter search for a dynamic cell formation problem, Tabu search-based metaheuristic algorithm for software system reliability problems, An effective heuristic for project scheduling with resource availability cost, Restart strategies for GRASP with path-relinking heuristics, Path relinking for unconstrained binary quadratic programming, Multi‐objective optimization using metaheuristics: non‐standard algorithms, A fast swap-based local search procedure for location problems, A reactive GRASP with path relinking for capacitated clustering, Tabu search -- uncharted domains, A knapsack problem as a tool to solve the production planning problem in small foundries, A scatter search approach for the minimum sum-of-squares clustering problem, Hybrid scatter tabu search for unconstrained global optimization, Parametric tabu-search for mixed integer programs, Exploring relaxation induced neighborhoods to improve MIP solutions, Minimizing labor requirements in a periodic vehicle loading problem, Path relinking for the vehicle routing problem, The oracle penalty method, Near-optimal solutions for the generalized max-controlled set problem, Greedy random adaptive memory programming search for the capacitated clustering problem, A hybrid scatter search heuristic for personalized crew rostering in the airline industry, Two-level evolutionary approach to the survivable mesh-based transport network topological design, A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times, A parallel evolutionary multiple-try Metropolis Markov chain Monte Carlo algorithm for sampling spatial partitions, A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling, Analysis of new variable selection methods for discriminant analysis, Hybridizations of GRASP with path relinking for the far from most string problem, On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs, GRASP with path-relinking for the generalized quadratic assignment problem, A new bi-objective fuzzy portfolio selection model and its solution through evolutionary algorithms, Cyber swarm algorithms - improving particle swarm optimization using adaptive memory strategies, Hybrid algorithms for placement of virtual machines across geo-separated data centers, Scatter search --- wellsprings and challenges, Scatter search in software testing, comparison and collaboration with estimation of distribution algorithms, Scatter search with path relinking for phylogenetic inference, Hybrid scatter search and path relinking for the capacitated \(p\)-median problem, Scatter search for the vehicle routing problem with time windows, Scatter search for project scheduling with resource availability cost, A hybrid scatter search/electromagnetism meta-heuristic for project scheduling, Comparing metaheuristic algorithms for SONET network design problems, A GRASP and path relinking heuristic for rural road network development, A set covering approach for multi-depot train driver scheduling, A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem, A novel hybrid multi-objective algorithm to solve the generalized cubic cell formation problem, Scheduled Service Network Design for Freight Rail Transportation, A hybrid metaheuristic method for the maximum diversity problem, Metaheuristics in combinatorial optimization, Scatter search and bionomic algorithms for the aircraft landing problem
Uses Software
