Pages that link to "Item:Q3686413"
From MaRDI portal
The following pages link to An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure (Q3686413):
Displaying 48 items.
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem (Q2643948) (← links)
- A hybrid genetic algorithm for the two-dimensional single large object placement problem (Q2643949) (← links)
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem (Q2643950) (← links)
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem (Q2643953) (← links)
- An integrated cutting stock and sequencing problem (Q2643965) (← links)
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview (Q2669629) (← links)
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container (Q2673561) (← links)
- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem (Q2803256) (← links)
- The pallet loading problem: a review of solution methods and computational experiments (Q2803259) (← links)
- SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects (Q2803261) (← links)
- A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application (Q2803262) (← links)
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints (Q2862156) (← links)
- MPQ-trees for orthogonal packing problem (Q2883589) (← links)
- An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem (Q2960365) (← links)
- Metaheuristics for truck loading in the car production industry (Q2968504) (← links)
- HEURISTICS WITH STOCHASTIC NEIGHBORHOOD STRUCTURES FOR TWO-DIMENSIONAL BIN PACKING AND CUTTING STOCK PROBLEMS (Q2998846) (← links)
- ON THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM UNDER HOME DELIVERY SERVICE (Q3103655) (← links)
- The pallet packing problem for non-uniform box sizes (Q3354581) (← links)
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces (Q3401326) (← links)
- The pinwheel pattern and its application to the manufacturer's pallet-loading problem (Q3401334) (← links)
- A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM (Q3503066) (← links)
- Modeling of packing problems (Q3835624) (← links)
- Sequential design with applications to the trim-loss problem (Q4230103) (← links)
- A Modeling-Based Approach for Non-standard Packing Problems (Q4634972) (← links)
- Cutting and Packing Problems with Placement Constraints (Q4634975) (← links)
- Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting (Q4634978) (← links)
- Exploiting Packing Components in General-Purpose Integer Programming Solvers (Q4634979) (← links)
- AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS (Q4650598) (← links)
- The solution of packing problems with pieces variable length and additional allocation constraints (Q4888260) (← links)
- An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem (Q5058727) (← links)
- The Meet-in-the-Middle Principle for Cutting and Packing Problems (Q5137950) (← links)
- Um método heurístico baseado em relaxação Lagrangiana para o problema de carregamento de paletes do produtor (Q5189098) (← links)
- Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints (Q5270072) (← links)
- Consecutive ones matrices for multi-dimensional orthogonal packing problems (Q5891542) (← links)
- Consecutive ones matrices for multi-dimensional orthogonal packing problems (Q5917883) (← links)
- Analysis of upper bounds for the pallet loading problem (Q5939589) (← links)
- A fast algorithm for two-dimensional pallet loading problems of large size (Q5945208) (← links)
- Partitioning a matrix with non-guillotine cuts to minimize the maximum cost (Q5957361) (← links)
- An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
- Rectangle packing with a recursive pilot method (Q6065652) (← links)
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern (Q6067889) (← links)
- Exact approaches for the unconstrained two-dimensional cutting problem with defects (Q6068735) (← links)
- The static stability of support factor‐based rectangular packings: an assessment by regression analysis (Q6092535) (← links)
- Cargo securing under multi-drop and axle weight constraints (Q6106972) (← links)
- Solving the three-dimensional open-dimension rectangular packing problem: a constraint programming model (Q6568471) (← links)
- A skyline-based heuristic for orthogonal packing rectangles in a circle (Q6568481) (← links)
- Revenue maximization for multiple advertisements placement on a web banner using a pixel-price model (Q6573359) (← links)
- Models for two-dimensional bin packing problems with customer order spread (Q6621849) (← links)