Instruct: Given a scientific paper title, retrieve paper titles that are cited by the given paper.
Query: Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand
Assortment planning: Review of literature and industry practice
Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
The Multidimensional Knapsack Problem: Structure and Algorithms
An exact algorithm for the fixed-charge multiple knapsack problem
Comparative Models of the File Assignment Problem
a new algorithm for the assignment problem .
A new greedy algorithm for the quadratic assignment problem
A new mathematical programming formulation for the Single-Picker Routing Problem
Combinatorial optimization : algorithms and complexity
A survey of variants and extensions of the location-routing problem
Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
Solving the sequential ordering problem using branch and bound
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
A knapsack secretary problem with applications
The multidimensional 0-1 knapsack problem: An overview
An Approximate Dual Projective Algorithm for Solving Assignment Problems
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size
Different Approaches to Solve the 0 / 1 Knapsack Problem
The traveling salesman problem: An overview of exact and approximate algorithms
An End-to-end 3D Convolutional Neural Network for Action Detection and Segmentation in Videos
BeepBeep: A high-accuracy acoustic-based system for ranging and localization using COTS devices
Sentiment Analysis of Microblogs
Demand Estimation and Assortment Optimization Under Substitution: Methodology and Application
Thor's Hammer: An Ungrounded Force Feedback Device Utilizing Propeller-Induced Propulsive Force