Algorithms for randomized time-varying knapsack problems

DOI10.1007/s10878-014-9717-1zbMath1341.90110OpenAlexW2036676833MaRDI QIDQ5963612

Suo-gang Gao, Wenbin Li, Weili Wu, Xinlu Zhang, Xiang Li, Yi-Chao He

Publication date: 23 February 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9717-1

zbMATH Keywords

heuristicsapproximationsknapsack problemexact algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (2)

Exact algorithms for the 0-1 time-bomb knapsack problem ⋮ Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem

Cites Work

• A Modified Binary Particle Swarm Optimization for Knapsack Problems
• Design and analysis of approximation algorithms
• Evolutionary algorithm to traveling salesman problems
• A new population based adaptive domination change mechanism for diploid genetic algorithms in dynamic environments
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
• Evolutionary Computation for Modeling and Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for randomized time-varying knapsack problems