Pages that link to "Item:Q3114774"

The following pages link to An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems (Q3114774):

Displaying 39 items.

• A ``reduce and solve'' approach for the multiple-choice multidimensional knapsack problem (Q297243) (← links)
• An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters (Q323016) (← links)
• Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm (Q342027) (← links)
• Minimum and worst-case performance ratios of rollout algorithms (Q415370) (← links)
• Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem (Q474490) (← links)
• Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search (Q706997) (← links)
• Scatter search for the 0-1 multidimensional knapsack problem (Q928688) (← links)
• Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem (Q960412) (← links)
• Heuristics for the 0-1 multidimensional knapsack problem (Q1042198) (← links)
• An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem (Q1683061) (← links)
• A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs (Q1698902) (← links)
• Value function approximation for dynamic multi-period vehicle routing (Q1749495) (← links)
• An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem (Q1753394) (← links)
• Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem (Q1761939) (← links)
• Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints (Q1781556) (← links)
• Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem (Q1994450) (← links)
• An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
• New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups (Q2140335) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• Meso-parametric value function approximation for dynamic customer acceptances in delivery routing (Q2183325) (← links)
• A variable-grouping based genetic algorithm for large-scale integer programming (Q2509223) (← links)
• Dynamic programming and suboptimal control: a survey from ADP to MPC (Q2511993) (← links)
• An approximate dynamic programming approach to convex quadratic knapsack problems (Q2566930) (← links)
• Model predictive control for dynamic resource allocation (Q2925344) (← links)
• A dynamic programming approach to the multiple-choice multi-period knapsack problem and the recursive APL2 code (Q3002339) (← links)
• An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem (Q3184585) (← links)
• Modeling multiple plant sourcing decisions (Q3532786) (← links)
• A Note on Approximation Schemes for Multidimensional Knapsack Problems (Q3718485) (← links)
• A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (Q4289294) (← links)
• (Q4350063) (← links)
• (Q4900928) (← links)
• (Q4945108) (← links)
• Network-Based Approximate Linear Programming for Discrete Optimization (Q5144795) (← links)
• Defense and security planning under resource uncertainty and multi‐period commitments (Q6051605) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)
• A deep real options policy for sequential service region design and timing (Q6065667) (← links)
• Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows (Q6106578) (← links)
• A unified pre-training and adaptation framework for combinatorial optimization on graphs (Q6564775) (← links)
• A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack (Q6568952) (← links)