Algorithms for randomized time-varying knapsack problems

DOI10.1007/S10878-014-9717-1MaRDI QIDQ5963612zbMATH OpenOpenAlexFDO

Authors Yichao He, Xinlu Zhang, Wenbin Li, Weili Wu, Suogang Gao, Xiang Li

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

heuristicsexact algorithmknapsack problemapproximations

Mathematics Subject Classification ID

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

Recommendations

• Exact algorithms and evolutionary algorithms for randomized time-varying knapsack problem
• Randomized time-varying knapsack problems via binary beetle antennae search algorithm: emphasis on applications in portfolio insurance
• Heuristic policies for stochastic knapsack problem with time-varying random demand
• Stochastic on-line knapsack problems
• scientific article; zbMATH DE number 4047112

Cites work

• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 793950 (Why is no real title available?)
• scientific article; zbMATH DE number 1418967 (Why is no real title available?)
• A Modified Binary Particle Swarm Optimization for Knapsack Problems
• A new population based adaptive domination change mechanism for diploid genetic algorithms in dynamic environments
• Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
• Design and analysis of approximation algorithms
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Evolutionary Computation for Modeling and Optimization
• Evolutionary algorithm to traveling salesman problems
• Evolutionary optimization algorithms. Biologically inspired and population-based approaches to computer intelligence
• Introduction to algorithms

Cited in

(5)

• Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem
• Exact algorithms and evolutionary algorithms for randomized time-varying knapsack problem
• Exact algorithms for the 0-1 time-bomb knapsack problem
• A PTAS for the time-invariant incremental knapsack problem
• Randomized time-varying knapsack problems via binary beetle antennae search algorithm: emphasis on applications in portfolio insurance

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963612)