scientific article; zbMATH DE number 1488097
From MaRDI portal
zbMath0985.90095MaRDI QIDQ4495203
Nenad Mladenović, Pierre Hansen
Publication date: 2 June 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A unified heuristic for a large class of vehicle routing problems with backhauls, Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem, On optimum life-testing plans under type-II progressive censoring scheme using variable neighborhood search algorithm, Variable neighborhood search for integrated timetable based design of railway infrastructure, Variable neighborhood search for the degree-constrained minimum spanning tree problem, Dynamic capacitated lot-sizing problems: a classification and review of solution approaches, Optimal plan for ordered step-stress stage life testing, Storage assignment and order batching problem in Kiva mobile fulfilment system, Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date, Minimising maximum response time, Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent, A general heuristic for vehicle routing problems, Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach, Hybrid Metaheuristics: An Introduction, Fat-tailed distributions for continuous variable neighborhood search, Feature selection in machine learning via variable neighborhood search, Computation of optimum type-II progressively hybrid censoring schemes using variable neighborhood search algorithm, Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search., A variable neighborhood decomposition search method for supply chain management planning problems, Exact and heuristic solutions to minimize total waiting time in the blood products distribution problem, Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches, Solving the resource-constrained project scheduling problem by a variable neighbourhood search., An efficient local search for the feedback vertex set problem, Operations research and data mining, A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem, Design of hybrids for the minimum sum-of-squares clustering problem, Bringing order into the neighborhoods: Relaxation guided variable neighborhood search, A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems, The balanced academic curriculum problem revisited, Variable neighbourhood search: methods and applications, Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem, Human-guided search, A simple tabu search for warehouse location, Scheduling workover rigs for onshore oil production, Variable neighborhood search for the maximum clique, The undirected capacitated arc routing problem with profits, Variable neighborhood search for the linear ordering problem, A cooperative parallel meta-heuristic for the vehicle routing problem with time windows, Iterated local search for the quadratic assignment problem, Adaptive memory programming: a unified view of metaheuristics, Neighborhood portfolio approach for local search applied to timetabling problems, New heuristics for one-dimensional bin-packing, Variable neighborhood search for the stochastic and dynamic vehicle routing problem, Comprehensive optimization of urban rail transit timetable by minimizing total travel times under time-dependent passenger demand and congested conditions, A black-box scatter search for optimization problems with integer variables, Analysis of new variable selection methods for discriminant analysis, Influence of a neighborhood shape on the efficiency of continuous variable neighborhood search, Variable neighbourhood search: Methods and applications, A new variable neighborhood search approach for solving dynamic memory allocation problem, A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows, The maximum capture problem with random utilities: problem formulation and algorithms, Fuzzy J-means: a new heuristic for fuzzy clustering, Probabilistic satisfiability with imprecise probabilities, Metaheuristics in combinatorial optimization
Uses Software
