Less is more approach in optimization: a road to artificial intelligence
type: Item
instance of: scholarly article
title: Less is more approach in optimization: a road to artificial intelligence
zbMATH Open document ID: 1484.90142
author: Jun Pei
author: Panos M. Pardalos
author: Dragan Urošević
author: Nenad Mladenović
published in: Optimization Letters
publication date: 2022-01-21T00:00:00Z
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7461757
zbMATH Keywords: optimization
zbMATH Keywords: less is more approach
zbMATH Keywords: variable neighborhood search
zbMATH Keywords: metaheuristics
zbMATH Keywords: artificial intelligence
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: s11590-021-01818-w
OpenAlex ID: W3213022196
cites work: Solving the maximum min-sum dispersion by alternating formulations of two different problems
cites work: Bee colony optimization for the \(p\)-center problem
cites work: A new formulation and resolution method for the \(p\)-center problem
cites work: Less is more: Simplified Nelder-Mead method for large unconstrained optimization
cites work: Attraction probabilities in variable neighborhood search
cites work: A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
cites work: Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
cites work: Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
cites work: Variable neighborhood search
cites work: Formulation Space Search for Circle Packing Problems
cites work: Variable neighbourhood search for bandwidth reduction
cites work: The equitable dispersion problem
cites work: The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation
DOI: 10.1007/S11590-021-01818-W
description: scientific article; zbMATH DE number 7461757