scientific article
From MaRDI portal
Publication:2776569
zbMath1017.90130MaRDI QIDQ2776569
Nenad Mladenović, Pierre Hansen
Publication date: 8 July 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Search theory (90B40) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (29)
Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem ⋮ Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem ⋮ A nonmonotone GRASP ⋮ Heuristics for the mirrored traveling tournament problem ⋮ The \(p\)-median problem: a survey of metaheuristic approaches ⋮ Learning multicriteria fuzzy classification method PROAFTN from data ⋮ A metaheuristic approach to solving a multiproduct EOQ-based inventory problem with storage space constraints ⋮ A variable neighborhood search based algorithm for finite-horizon Markov decision processes ⋮ On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification ⋮ General variable neighborhood search approach to group Steiner tree problem ⋮ Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs ⋮ The intermittent travelling salesman problem ⋮ Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem ⋮ General variable neighborhood search for the continuous optimization ⋮ A modified VNS metaheuristic for max-bisection problems ⋮ A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule ⋮ Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem ⋮ General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem ⋮ A modified variable neighborhood search for the discrete ordered median problem ⋮ Variable neighbourhood search: methods and applications ⋮ Variable neighborhood search and local branching ⋮ Sequential search and its application to vehicle-routing problems ⋮ A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem ⋮ A hybrid heuristic for the diameter constrained minimum spanning tree problem ⋮ A cooperative parallel meta-heuristic for the vehicle routing problem with time windows ⋮ Edge-swapping algorithms for the minimum fundamental cycle basis problem ⋮ Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times ⋮ A new variable neighborhood search approach for solving dynamic memory allocation problem ⋮ Metaheuristics in combinatorial optimization
This page was built for publication:
