knapsack problem

A Novel Method to Solve Neural Knapsack Problems ICML 2021 Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization AAAI 2021 Novel Upper Bounds for the Constrained Most Probable Explanation Task NeurIPS 2021 Online Knapsack with Frequency Predictions NeurIPS 2021 Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size AAAI 2021 With Measured Words: Simple Sentence Selection for Black-Box Optimization of Sentence Compression Algorithms EACL 2021 A Novel Approach for Constrained Optimization in Graphical Models NeurIPS 2020 A State Aggregation Approach for Solving Knapsack Problem with Deep Reinforcement Learning ACML 2020 Fair Knapsack AAAI 2019 Predict+Optimise with Ranking Objectives: Exhaustively Learning Linear Functions IJCAI 2019 Randomized Strategies for Robust Combinatorial Optimization AAAI 2019 Rotational Diversity in Multi-Cycle Assignment Problems AAAI 2019 Unifying the Stochastic and the Adversarial Bandits with Knapsack IJCAI 2019 Combinatorial Semi-Bandits with Knapsacks AISTATS 2018 Online Learning of Optimal Bidding Strategy in Repeated Multi-Commodity Auctions NeurIPS 2017 Linear Contextual Bandits with Knapsacks NeurIPS 2016 Task Variant Allocation in Distributed Robotics RSS 2016 Resourceful Contextual Bandits COLT 2014