Algorithms for randomized time-varying knapsack problems
From MaRDI portal
Publication:5963612
DOI10.1007/S10878-014-9717-1zbMATH Open1341.90110OpenAlexW2036676833MaRDI QIDQ5963612FDOQ5963612
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
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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Introduction to algorithms
- Evolutionary optimization algorithms. Biologically inspired and population-based approaches to computer intelligence
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
- Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
- Design and analysis of approximation algorithms
- Evolutionary Computation for Modeling and Optimization
- A new population based adaptive domination change mechanism for diploid genetic algorithms in dynamic environments
- Evolutionary algorithm to traveling salesman problems
Cited In (3)
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)
