A K-means supported reinforcement learning framework to multi-dimensional knapsack
From MaRDI portal
Publication:6568952
DOI10.1007/S10898-024-01364-6MaRDI QIDQ6568952FDOQ6568952
Authors: Sabah Bushaj, İ. Esra Büyüktahtakın 
Publication date: 8 July 2024
Published in: Journal of Global Optimization (Search for Journal in Brave)
Recommendations
- Reinforcement learning for the knapsack problem
- An approximate dynamic programming approach to multidimensional knapsack problems
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners
- High generalization performance structured self-attention model for knapsack problem
heuristicscombinatorial optimizationmixed integer programming\(K\)-meansmulti-dimensional knapsack problemdeep reinforcement learning
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Least squares quantization in PCM
- Deep learning
- Title not available (Why is that?)
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- A Minimal Algorithm for the 0-1 Knapsack Problem
- Approximation algorithms for knapsack problems with cardinality constraints
- Improved results on the 0--1 multidimensional knapsack problem
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- An approximate dynamic programming approach to multidimensional knapsack problems
- Heuristics for the 0-1 multidimensional knapsack problem
- A genetic algorithm for the multidimensional knapsack problem
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Greedy algorithm for the general multidimensional knapsack problem
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- Title not available (Why is that?)
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- An efficient algorithm to allocate shelf space
- Pivot and Complement–A Heuristic for 0-1 Programming
- Efficient Heuristic Procedures for Integer Linear Programming with an Interior
- Title not available (Why is that?)
- Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach
- A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play
- A recursive branch and bound algorithm for the multidimensional knapsack problem
- CORAL: an exact algorithm for the multidimensional knapsack problem
- A heuristic with tie breaking for certain 0–1 integer programming models
- Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs
- COVID-19: data-driven optimal allocation of ventilator supply under uncertainty and risk
- Reinforcement learning for variable selection in a branch and bound algorithm
- Learning optimal solutions via an LSTM-optimization framework
- Risk-averse multi-stage stochastic optimization for surveillance and operations planning of a forest insect infestation
- An expandable machine learning-optimization framework to sequential decision-making
- Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems
This page was built for publication: A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568952)
