Instruct: Given a paper title, retrieve paper titles that are cited by the given paper
Query: Solving real-world cutting stock-problems in the paper industry: Mathematical approaches, experience and challenges
a typology of cutting and packing problems .
Cutting and Packing
A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
Knapsack Problems: Algorithms and Computer Implementations (S. Martello and P. Toth)
A cutting plane method for solving linear generalized disjunctive programming problems
Manufacturing Problem Solving in a Job Shop — Research in Layout Planning
A Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
Integer linear programming models for 2-staged two-dimensional Knapsack problems
A knapsack secretary problem with applications
Different Approaches to Solve the 0 / 1 Knapsack Problem
An automatic method for solving discrete programming problems
Two-dimensional Disjunctively Constrained Knapsack Problem: Heuristic and exact approaches
Improved solutions for the traveling purchaser problem
Multi-dimensional Bin Packing Problems with Guillotine Constraints
Branch-and-price: Column generation for solving huge integer programs
A polyhedral branch-and-cut approach to global optimization
A Genetic Algorithm for a 2D Industrial Packing Problem
A theorem on polygon cutting with applications
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
Solving the pallet loading problem
Computers And Intractability A Guide To The Theory Of Np Completeness
Named Entity Recognition from Biomedical Text Using SVM
Innovation at the Intersection of Clinical Trials and Real‐World Data Science to Advance Patient Care
Does Continuous Requirements Engineering need Continuous Software Engineering?
Jointly learning to align and convert graphemes to phonemes with neural attention models