Instruct: Given the title of a paper, retrieve paper titles that are cited by the given paper
Query: Assessing Optimal Assignment under Uncertainty: An Interval-based Algorithm.
The Hungarian Method for the Assignment Problem
Solution of a Fuzzy Assignment Problem by Using a New Ranking Method
Dynamic capacity acquisition and assignment under uncertainty
Improving the Performance of IndependentTask Assignment Heuristics MinMin,MaxMin and Sufferage
Approximation Algorithms for Stochastic Optimization Problems in Operations Management
Strategies for Handling Temporal Uncertainty in Pickup and Delivery Problems with Time Windows
a new robust optimization approach for scheduling under uncertainty : : i . bounded uncertainty .
Hungarian optimum assignment algorithm with Java computer animation
A new greedy algorithm for the quadratic assignment problem
A Survey of Solution Methods for the Continuous Location-Allocation Problem
A stochastic neighborhood search approach for airport gate assignment problem
The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes
Optimization under uncertainty: State-of-the-art and opportunities
A Distributed Version of the Hungarian Method for Multirobot Assignment
An Enhanced Branch-and-bound Algorithm for the Talent Scheduling Problem
Crew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search
A General Statistical Framework for Designing Strategy-proof Assignment Mechanisms
A new mathematical programming formulation for the Single-Picker Routing Problem
Robust optimization for decision-making under endogenous uncertainty
A shortest augmenting path algorithm for dense and sparse linear assignment problems
Thidiazuron-induced high-frequency direct shoot organogenesis of Cannabis sativa L.
Array regrouping and structure splitting using whole-program reference affinity
Brand trust and brand extension acceptance: the relationship
A Novel Unit Power Factor Rectifier Based on Three-phase Digital PLL
The dynamic assignment problem