Instruct: Given the title of a paper, retrieve paper titles that are cited by the given paper
Query: 2D cutting stock problem: a new parallel algorithm and bounds
A parallel algorithm for the two-dimensional cutting stock problem
a new placement heuristic for the orthogonal stock - cutting problem .
The irregular cutting-stock problem - a new procedure for deriving the no-fit polygon
A Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
Chapter 5 PARALLEL ALGORITHM DESIGN FOR BRANCH AND BOUND
lp models for bin packing and cutting stock problems .
Multi-dimensional Bin Packing Problems with Guillotine Constraints
Computational aspects of a branch and bound algorithm for quadratic zero-one programming
Bin Packing Problem: Two Approximation Algorithms
A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
Lower bounds and reduction procedures for the bin packing problem
Knapsack Problems: Algorithms and Computer Implementations (S. Martello and P. Toth)
Two-dimensional Disjunctively Constrained Knapsack Problem: Heuristic and exact approaches
Heuristic and Exact Algorithms for the 2 D Knapsack Problem with Relations Between Items
A two-stage intelligent search algorithm for the two-dimensional strip packing problem
Solving the sequential ordering problem using branch and bound
Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
exact algorithms for the two - dimensional strip packing problem with and without rotations .
A Genetic Algorithm for theTwo-Dimensional Knapsack Problemwith Rectangular Pieces
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Minimum inhibitory (MIC) and minimum microbicidal concentration (MMC) of polihexanide and triclosan against antibiotic sensitive and resistant Staphylococcus aureus and Escherichia coli strains
Fast-moving soft electronic fish
Toward Predicting the Outcome of an A/B Experiment for Search Relevance
M3Express: A low-cost independently-mobile reconfigurable modular robot