Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization
type: Item
instance of: scholarly article
title: Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization
zbMATH Open document ID: 1436.90116
published in: Information Sciences
publication date: 2020-07-16T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7221548
zbMATH Keywords: dynamic combinatorial optimization
zbMATH Keywords: greedy randomized adaptive search procedure
zbMATH Keywords: metaheuristic algorithms
zbMATH Keywords: multi-dimensional knapsack problem
Wikidata QID: Q65555201
author: Adil Baykasoğlu
author: Fehmi Burcin Ozsoydan
describes a project that uses: WCA
MaRDI profile type: Publication
full work available at URL: j.ins.2017.08.058
OpenAlex ID: W2747672495
cites work: A survey on combinatorial optimization in dynamic environments
cites work: Q4451075
cites work: Greedy randomized adaptive search procedures
cites work: Q4692508
cites work: Q4821303
cites work: An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem
cites work: A partheno-genetic algorithm for dynamic 0-1 multidimensional Knapsack problem
cites work: Firefly Algorithms for Multimodal Optimization
cites work: Metaheuristics for dynamic combinatorial optimization problems
DOI: 10.1016/J.INS.2017.08.058
description: scientific article; zbMATH DE number 7221548