An approximate dynamic programming approach to multidimensional knapsack problems
From MaRDI portal
Recommendations
- An approximate dynamic programming approach to convex quadratic knapsack problems
- Heuristics for the 0-1 multidimensional knapsack problem
- Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach
- An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem
- The multidimensional knapsack problem: structure and algorithms
Cited in
(42)- Heuristics for the 0-1 multidimensional knapsack problem
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
- A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs
- Value function approximation for dynamic multi-period vehicle routing
- An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem
- Problem reduction heuristic for the 0-1 multidimensional knapsack problem
- Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints
- Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
- An FPTAS for the -modular multidimensional knapsack problem
- New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Meso-parametric value function approximation for dynamic customer acceptances in delivery routing
- A variable-grouping based genetic algorithm for large-scale integer programming
- Dynamic programming and suboptimal control: a survey from ADP to MPC
- An approximate dynamic programming approach to convex quadratic knapsack problems
- Model predictive control for dynamic resource allocation
- A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
- A dynamic programming approach to the multiple-choice multi-period, knapsack problem and the recursive APL2 code
- An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem
- An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters
- Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm
- Modeling multiple plant sourcing decisions
- A Note on Approximation Schemes for Multidimensional Knapsack Problems
- Minimum and worst-case performance ratios of rollout algorithms
- A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem
- scientific article; zbMATH DE number 1054947 (Why is no real title available?)
- Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem
- scientific article; zbMATH DE number 6129400 (Why is no real title available?)
- scientific article; zbMATH DE number 1423920 (Why is no real title available?)
- Network-based approximate linear programming for discrete optimization
- Defense and security planning under resource uncertainty and multi‐period commitments
- Matheuristics: survey and synthesis
- A deep real options policy for sequential service region design and timing
- Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows
- A unified pre-training and adaptation framework for combinatorial optimization on graphs
- A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack
- A non-anticipative learning-optimization framework for solving multi-stage stochastic programs
- A fix and optimize method based approximate dynamic programming approach for the strategic fleet sizing and delivery planning problem
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
- Shaping decision models for stochastic dynamic optimization problems via reinforcement learning
- Scatter search for the 0-1 multidimensional knapsack problem
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
This page was built for publication: An approximate dynamic programming approach to multidimensional knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3114774)
