Multi-Start Methods
From MaRDI portal
Publication:4452901
DOI10.1007/0-306-48056-5_12zbMATH Open1102.90383OpenAlexW2197051856MaRDI QIDQ4452901FDOQ4452901
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
Recommendations
- Multi-start methods for combinatorial optimization
- A study of diversification strategies for the quadratic assignment problem
- Multistart with early termination of descents
- Allocation search methods for a generalized class of location-allocation problems
- A new adaptive multi-start technique for combinatorial global optimizations
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cited In (31)
- Multi-start methods for combinatorial optimization
- A review of distances for the Mallows and generalized Mallows estimation of distribution algorithms
- Strictly periodic scheduling in IMA-based architectures
- Discrete particle swarm optimization for the minimum labelling Steiner tree problem
- Solving the response time variability problem by means of a psychoclonal approach
- A general variable neighborhood search for the cyclic antibandwidth problem
- Combining Deflation and Nested Iteration for Computing Multiple Solutions of Nonlinear Variational Problems
- A multi-start iterated greedy algorithm for the minimum weight vertex cover \(P_3\) problem
- Local search with an exponential neighborhood for the servers load balancing problem
- Hamilton cycles in the semi-random graph process
- An Extended Necessity Measure Maximisation Incorporating the Trade-Off between Robustness and Satisfaction in Fuzzy LP Problems
- A variable neighborhood search heuristic for the maximum ratio clique problem
- Metaheuristics for bilevel optimization: a comprehensive review
- A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times
- Multi-point Constructive Search
- A hybrid beam search looking-ahead algorithm for the circular packing problem
- A new adaptive multi-start technique for combinatorial global optimizations
- A Metropolis-class sampler for targets with non-convex support
- Modeling, simulating, and parameter Fitting of biochemical kinetic experiments
- Variable neighborhood search approach to face-shield delivery during pandemic periods
- A tree-structured covalent-Bond-driven molecular memetic algorithm for optimization of ring-deficient molecules
- Seeking global edges for traveling salesman problem in multi-start search
- A multi-start local search heuristic for the multi-period auto-carrier loading and transportation problem in Brazil
- The location routing problem with facility sizing decisions
- Hopping between distant basins
- Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem
- A multi-start gradient combination method for high-performance global search
- A class of compartmental models for long-distance tracer transport in plants
- Image registration with iterated local search
- Tabu search directed by direct search methods for nonlinear global optimization
- A multi-start local search heuristic for ship scheduling -- a computational study
This page was built for publication: Multi-Start Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452901)
