Instruct: Given a scientific paper title, retrieve paper titles that are cited by the given paper.
Query: Online minimization knapsack problem
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Tight bounds for online vector bin packing
Lower bounds and reduction procedures for the bin packing problem
The Traveling Purchaser Problem and its variants
The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms
An analysis of the greedy algorithm for the submodular set covering problem
Towards Bin Packing (preliminary problem survey, models with multiset estimates)
A novel binary fruit fly optimization algorithm for solving the multidimensional knapsack problem
Bin Packing Problem: Two Approximation Algorithms
Algorithms for two bottleneck optimization problems
A General Greedy Approximation Algorithm with Applications
Guarantees for Greedy Maximization of Non-submodular Functions with Applications
There is no EPTAS for two-dimensional knapsack
Binary artificial algae algorithm for multidimensional knapsack problems
Combinatorial optimization : algorithms and complexity
Performance Analysis of Online Anticipatory Algorithms for Large Multistage Stochastic Integer Programs
Multidimensional Bin Packing and Other Related Problems : A Survey ∗
Distributed Submodular Maximization
A Linear Programming Approach for the Three-Dimensional Bin-Packing Problem
Approximation Algorithms for Computing Maximin Share Allocations
Reducibility Among Combinatorial Problems
Loop closure detection for visual SLAM systems using deep neural networks
Agent-oriented ontology for monitoring and detecting money laundering process
Integrating structured biological data by kernel maximum mean discrepancy
Dual band inkjet printed bow-tie slot antenna on leather