We provide an exact algorithm to solve the log-linear continuous (fractional) knapsack problem. The algorithm is based on two lemmas that follow from the application of weak duality theorem and complementary slackness theorem to the linear optimization problem with linear objective function that is associated with any solution of a linear optimization problem with (differentiable) concave objective function.
Efficient exact sequential lifting algorithm for binary knapsack set
School of Mathematics and Statistics, Beijing Institute of Technology(北京理工大学数学与统计学院);Institute of Computational Mathematics and Scientific/Engineering Computing, Academy of Mathematics and Systems Science, Chinese Academy of Sciences(中国科学院数学与系统科学研究院计算数学与科学工程计算研究所)
Dynamic-Threshold Algorithms for the Continuous Quadratic Knapsack Problem: Reset Mechanisms and Complexity
Center for Applied Mathematics of Fujian Province, School of Mathematics and Statistics, Fuzhou University(福建省应用数学中心,福州大学数学与统计学院);School of Mathematics and Statistics, Fuzhou University(福州大学数学与统计学院)
A Re-solving Heuristic for Dynamic Assortment Optimization with Knapsack Constraints
Stern School of Business, New York University(纽约大学斯特恩商学院);Department of Statistics and Operations Research, University of North Carolina(北卡罗来纳大学统计与运筹学系);Naveen Jindal School of Management, University of Texas at Dallas(德克萨斯大学达拉斯分校纳文·金达尔管理学院);Yau Mathematical Sciences Center & Department of Mathematical Sciences, Tsinghua University(清华大学丘成桐数学科学中心及数学科学系)
A scenario-cluster-based and enhanced progressive hedging algorithm for the two-stage stochastic quadratic knapsack problem
GERAD, CIRRELT & Department of Analytics, Operations and Information Technology, Université du Québec à Montréal(蒙特利尔大学 GERAD、CIRRELT 与分析、运营与信息技术系);GERAD, CIRRELT & Department of Operations and Decision Systems, Université Laval(魁北克大学拉瓦尔分校 GERAD、CIRRELT 与运营与决策系统系);GERAD, CRM & Department of Analytics, Operations and Information Technology, Université du Québec à Montréal(蒙特利尔大学 GERAD、CRM 与分析、运营与信息技术系)
Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities
Center on Frontiers of Computing Studies, Peking University School of Computer Science, Peking University(前沿计算研究所以及北京大学计算机科学学院,北京大学);Guanghua School of Management, Peking University(光华管理学院,北京大学);Department of Management Science and Engineering, Stanford University(管理科学与工程系,斯坦福大学)