Less is more approach in optimization: a road to artificial intelligence
From MaRDI portal
Publication:2070138
DOI10.1007/s11590-021-01818-wzbMath1484.90142OpenAlexW3213022196MaRDI QIDQ2070138
Dragan Urošević, Jun Pei, Panos M. Pardalos, Nenad Mladenović
Publication date: 21 January 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-021-01818-w
Related Items
Uses Software
Cites Work
- The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation
- Bee colony optimization for the \(p\)-center problem
- Attraction probabilities in variable neighborhood search
- The equitable dispersion problem
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
- Variable neighborhood search
- Solving the maximum min-sum dispersion by alternating formulations of two different problems
- Variable neighbourhood search for bandwidth reduction
- A New Formulation and Resolution Method for the p-Center Problem
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- Less is more: Simplified Nelder-Mead method for large unconstrained optimization
- Formulation Space Search for Circle Packing Problems
- Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem