Multi-Start Methods
From MaRDI portal
Publication:4452901
DOI10.1007/0-306-48056-5_12zbMath1102.90383OpenAlexW2197051856MaRDI QIDQ4452901
Publication date: 7 March 2004
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/0-306-48056-5_12
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (26)
A class of compartmental models for long-distance tracer transport in plants ⋮ A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times ⋮ A variable neighborhood search heuristic for the maximum ratio clique problem ⋮ A tree-structured covalent-Bond-driven molecular memetic algorithm for optimization of ring-deficient molecules ⋮ A review of distances for the Mallows and generalized Mallows estimation of distribution algorithms ⋮ The location routing problem with facility sizing decisions ⋮ Metaheuristics for bilevel optimization: a comprehensive review ⋮ A multi-start local search heuristic for the multi-period auto-carrier loading and transportation problem in Brazil ⋮ Combining Deflation and Nested Iteration for Computing Multiple Solutions of Nonlinear Variational Problems ⋮ A multi-start local search heuristic for ship scheduling -- a computational study ⋮ Strictly periodic scheduling in IMA-based architectures ⋮ Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem ⋮ Seeking global edges for traveling salesman problem in multi-start search ⋮ Hamilton cycles in the semi-random graph process ⋮ Discrete particle swarm optimization for the minimum labelling Steiner tree problem ⋮ A multi-start iterated greedy algorithm for the minimum weight vertex cover \(P_3\) problem ⋮ Solving the response time variability problem by means of a psychoclonal approach ⋮ Image registration with iterated local search ⋮ A hybrid beam search looking-ahead algorithm for the circular packing problem ⋮ Modeling, Simulating, and Parameter Fitting of Biochemical Kinetic Experiments ⋮ A Metropolis-class sampler for targets with non-convex support ⋮ Hopping between distant basins ⋮ Tabu search directed by direct search methods for nonlinear global optimization ⋮ Local search with an exponential neighborhood for the servers load balancing problem ⋮ A general variable neighborhood search for the cyclic antibandwidth problem ⋮ An Extended Necessity Measure Maximisation Incorporating the Trade-Off between Robustness and Satisfaction in Fuzzy LP Problems
This page was built for publication: Multi-Start Methods
