The following pages link to Guntram Scheithauer (Q315514):
Displayed 20 items.
- (Q4233346) (← links)
- (Q4398379) (← links)
- LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap (Q4596192) (← links)
- Creating Worst-Case Instances for Upper and Lower Bounds of the Two-Dimensional Strip Packing Problem (Q4596193) (← links)
- Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem (Q4596196) (← links)
- Creating Worst-Case Instances for Lower Bounds of the 2D Strip Packing Problem (Q4596449) (← links)
- On the Solution of Generalized Spectrum Allocation Problems (Q4596453) (← links)
- Cutting and Packing Problems with Placement Constraints (Q4634975) (← links)
- Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory (Q4646531) (← links)
- An Improved Upper Bound for the Gap of Skiving Stock Instances of the Divisible Case (Q4685755) (← links)
- The G4-Heuristic for the Pallet Loading Problem (Q4717141) (← links)
- Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem (Q4805783) (← links)
- (Q4828033) (← links)
- A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem (Q4834079) (← links)
- (Q4848284) (← links)
- (Q4858956) (← links)
- The solution of packing problems with pieces variable length and additional allocation constraints (Q4888260) (← links)
- A Computational Study of Reduction Techniques for the Minimum Connectivity Inference Problem (Q5114944) (← links)
- An improved flow-based formulation and reduction principles for the minimum connectivity inference problem (Q5197998) (← links)
- A branch-and-bound approach for a vehicle routing problem with customer costs (Q6114901) (← links)