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

DOI10.1007/s10898-024-01364-6MaRDI QIDQ6568952

Sabah Bushaj, İ. Esra Büyüktahtakın

Publication date: 8 July 2024

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

heuristicscombinatorial optimizationmixed integer programming\(K\)-meansmulti-dimensional knapsack problemdeep reinforcement learning

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

Cites Work

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

This page was built for publication: A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack