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

KAD: A Framework for Proxy-based Test-time Alignment with Knapsack Approximation Deferral EACL 2026
Efficient Chromosome Parallelization for Precision Medicine Genomic Workflows AAAI 2026
Online Capacitated General Matching with Knapsack AAAI 2026
Augmenting Online Algorithms for Knapsack Problem with Total Weight Information AAAI 2025
Using Clustering to Strengthen Decision Diagram Bounds for Discrete Optimization AAAI 2024
Efficient Cost-Minimization Schemes for Electrical Energy Demand Satisfaction by Prosumers in Microgrids with Battery Storage Capabilities IJCAI 2024
Contextual Decision-Making with Knapsacks Beyond the Worst Case NIPS 2024
Parameterized Analysis of Bribery in Challenge the Champ Tournaments IJCAI 2024
Maximizing the Success Probability of Policy Allocations in Online Systems AAAI 2024
Robust Reward Placement under Uncertainty IJCAI 2024
SEER : A Knapsack approach to Exemplar Selection for In-Context HybridQA EMNLP 2023
Improved Algorithms for Multi-period Multi-class Packing Problems with Bandit Feedback ICML 2023
Small Total-Cost Constraints in Contextual Bandits with Knapsacks, with Application to Fairness NIPS 2023
Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression COLT 2023
Bandits with Knapsacks: Advice on Time-Varying Demands ICML 2023
Optimal Contextual Bandits with Knapsacks under Realizability via Regression Oracles AISTATS 2023
Approximately Optimal Core Shapes for Tensor Decompositions ICML 2023
Smoothed Adversarial Linear Contextual Bandits with Knapsacks ICML 2022
Non-stationary Bandits with Knapsacks NIPS 2022
Set-valued prediction in hierarchical classification with constrained representation complexity UAI 2022
Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem NIPS 2022
Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization AAAI 2021
Online Knapsack with Frequency Predictions NIPS 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