Instruct: Given the title of a paper, retrieve paper titles that are cited by the given paper.
Query: Heuristics and Exact Methods for Number partitioning
Optimization by simulated annealing: an experimental evaluation. Part I, graph partitioning
Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning
A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
A fast and high quality multilevel scheme for partitioning irregular graphs
Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
Combinatorial Designs by SAT Solvers.
Tight approximation algorithms for maximum general assignment problems
Solving Square Jigsaw Puzzles Using Dynamic Programming and the Hungarian Procedure
Lower bounds and reduction procedures for the bin packing problem
An optimal algorithm for the distinct elements problem
Exact sampling with integer linear programs and random perturbations
Parallel multilevel k-way partitioning scheme for irregular graphs
Fast local search for the steiner problem in graphs
The Quadratic Assignment Problem: A Survey and Recent Developments
Knapsack Problems: Algorithms and Computer Implementations (S. Martello and P. Toth)
The Hungarian Method for the Assignment Problem
The p-median problem: A survey of metaheuristic approaches
Cutting stock problems and solution procedures
Efficient algorithms for the offline variable sized bin-packing problem
Learning Relation Representations from Word Representations
Computers And Intractability A Guide To The Theory Of Np Completeness
Wide-band microstrip antenna with an H-shaped coupling aperture
A Syllable Based Word Recognition Model For Korean Noun Extraction
Optimizing the Seakeeping Performance of Ship Hull Forms Using Genetic Algorithm