Pages that link to "Item:Q1847188"

The following pages link to Two-dimensional packing problems: a survey (Q1847188):

Displaying 50 items.

• Exact algorithms for the two-dimensional strip packing problem with and without rotations (Q1027586) (← links)
• A branch-and-price algorithm for the two-dimensional level strip packing problem (Q1029564) (← links)
• A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779) (← links)
• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
• Multiple-type, two-dimensional bin packing problems: Applications and algorithms (Q1339128) (← links)
• New exact approaches and approximation results for the penalized knapsack problem (Q1634770) (← links)
• Provider selection and task allocation in telecommunications with QoS degradation policy (Q1639237) (← links)
• Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
• Scheduling under the network of temporo-spatial proximity relationships (Q1652320) (← links)
• Packing unequal rectangles and squares in a fixed size circular container using formulation space search (Q1652609) (← links)
• Combined cutting stock and lot-sizing problem with pattern setup (Q1652627) (← links)
• A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem (Q1665961) (← links)
• Redundant cumulative constraints to compute preemptive bounds (Q1686060) (← links)
• Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem (Q1686525) (← links)
• Co-scheduling algorithms for high-throughput workload execution (Q1702725) (← links)
• Offline first-fit decreasing height scheduling of power loads (Q1707831) (← links)
• Exact and heuristic methods for optimizing lock-quay system in inland waterway (Q1737520) (← links)
• A sequential value correction heuristic for a bi-objective two-dimensional bin-packing (Q1742194) (← links)
• The complexity landscape of decompositional parameters for ILP (Q1749387) (← links)
• Mixed-integer linear programming heuristics for the prepack optimization problem (Q1751183) (← links)
• Layout optimisation for an installation port of an offshore wind farm (Q1751774) (← links)
• A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem (Q1752837) (← links)
• Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources (Q1753460) (← links)
• The load planning problem for double-stack intermodal trains (Q1754216) (← links)
• Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts (Q1761944) (← links)
• A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem (Q1761945) (← links)
• New lower bounds for the three-dimensional finite bin packing problem (Q1827849) (← links)
• Heuristic algorithms for the three-dimensional bin packing problem (Q1847192) (← links)
• Models and bounds for two-dimensional level packing problems (Q1888172) (← links)
• Packing chained items in aligned bins with applications to container transshipment and project scheduling (Q1935930) (← links)
• Two-dimensional knapsack-block packing problem (Q1984921) (← links)
• Dynamic pricing for vehicle ferries: using packing and simulation to optimize revenues (Q1991289) (← links)
• Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost (Q2003581) (← links)
• The pallet loading problem: three-dimensional bin packing with practical constraints (Q2023993) (← links)
• Grids for cutting and packing problems: a study in the 2D knapsack problem (Q2025135) (← links)
• Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective (Q2028839) (← links)
• The forgotten sons: warehousing systems for brick-and-mortar retail chains (Q2028872) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• Queue-constrained packing: a vehicle ferry case study (Q2029061) (← links)
• Number of bins and maximum lateness minimization in two-dimensional bin packing (Q2029951) (← links)
• A hybrid metaheuristic for the two-dimensional strip packing problem (Q2069243) (← links)
• Techniques and results on approximation algorithms for packing circles (Q2082050) (← links)
• 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← links)
• Asynchronous optimization of part logistics routing problem (Q2124805) (← links)
• A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints (Q2140189) (← links)
• Adaptive simulated annealing with greedy search for the circle bin packing problem (Q2147115) (← links)
• An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem (Q2158621) (← links)
• Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem (Q2170201) (← links)
• Fragmentary structures in a two-dimensional strip packing problem (Q2174049) (← links)
• A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber (Q2219513) (← links)