A K-means supported reinforcement learning framework to multi-dimensional knapsack

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

Cites work

A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play
A genetic algorithm for the multidimensional knapsack problem
A heuristic algorithm for the multidimensional zero-one knapsack problem
A heuristic solution procedure for the multiconstraint zero-one knapsack problem
A heuristic with tie breaking for certain 0–1 integer programming models
A Minimal Algorithm for the 0-1 Knapsack Problem
A recursive branch and bound algorithm for the multidimensional knapsack problem
A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
An approximate dynamic programming approach to multidimensional knapsack problems
An efficient algorithm to allocate shelf space
An efficient tabu search approach for the 0-1 multidimensional knapsack problem
An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
An expandable machine learning-optimization framework to sequential decision-making
Approximation algorithms for knapsack problems with cardinality constraints
Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
CORAL: an exact algorithm for the multidimensional knapsack problem
COVID-19: data-driven optimal allocation of ventilator supply under uncertainty and risk
Deep learning
Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
Efficient Heuristic Procedures for Integer Linear Programming with an Interior
Greedy algorithm for the general multidimensional knapsack problem
Heuristics for the 0-1 multidimensional knapsack problem
scientific article; zbMATH DE number 1054947 (Why is no real title available?)
scientific article; zbMATH DE number 1114464 (Why is no real title available?)
scientific article; zbMATH DE number 1953201 (Why is no real title available?)
scientific article; zbMATH DE number 2107164 (Why is no real title available?)
scientific article; zbMATH DE number 7626783 (Why is no real title available?)
Improved results on the 0--1 multidimensional knapsack problem
Learning optimal solutions via an LSTM-optimization framework
Least squares quantization in PCM
New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach
Pivot and Complement–A Heuristic for 0-1 Programming
Reinforcement learning for variable selection in a branch and bound algorithm
Risk-averse multi-stage stochastic optimization for surveillance and operations planning of a forest insect infestation
Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems
Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs
Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data

Cited in

(3)

Discovering heuristics with large language models (LLMs) for mixed-integer programs: single-machine scheduling
A non-anticipative learning-optimization framework for solving multi-stage stochastic programs
A deep reinforcement learning framework for solving two-stage stochastic programs

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)