conftrace_

knapsack problem

39 papers

Explore in graph

Co-occurring keywords

combinatorial optimization (1039) regret bound (1926) contextual bandit (381) resource allocation (251) multi-armed bandit (1098) approximation algorithm (630) online algorithm (445) dynamic programming (274) online learning (1777) competitive ratio (74)

Papers

A Novel Method to Solve Neural Knapsack Problems ICML 2021
Novel Upper Bounds for the Constrained Most Probable Explanation Task NIPS 2021
A Novel Approach for Constrained Optimization in Graphical Models NIPS 2020
A State Aggregation Approach for Solving Knapsack Problem with Deep Reinforcement Learning ACML 2020
Predict+Optimise with Ranking Objectives: Exhaustively Learning Linear Functions IJCAI 2019
Unifying the Stochastic and the Adversarial Bandits with Knapsack IJCAI 2019
Randomized Strategies for Robust Combinatorial Optimization AAAI 2019
Fair Knapsack AAAI 2019
Rotational Diversity in Multi-Cycle Assignment Problems AAAI 2019
Combinatorial Semi-Bandits with Knapsacks AISTATS 2018
Online Learning of Optimal Bidding Strategy in Repeated Multi-Commodity Auctions NIPS 2017
Linear Contextual Bandits with Knapsacks NIPS 2016
Task Variant Allocation in Distributed Robotics RSS 2016
Resourceful Contextual Bandits COLT 2014