Pages that link to "Item:Q1592734"
From MaRDI portal
The following pages link to An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem (Q1592734):
Displaying 50 items.
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem (Q941553) (← links)
- A least wasted first heuristic algorithm for the rectangular packing problem (Q960413) (← links)
- Human-guided search (Q972653) (← links)
- An agent-based approach to the two-dimensional guillotine bin packing problem (Q1011220) (← links)
- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem (Q1015322) (← links)
- A branch and bound algorithm for the strip packing problem (Q1017971) (← links)
- Exact algorithms for the two-dimensional strip packing problem with and without rotations (Q1027586) (← links)
- Three-dimensional bin packing problem with variable bin height (Q1039777) (← links)
- Packing solar cells on a roof (Q1041385) (← links)
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem (Q1592734) (← links)
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
- Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation (Q1652199) (← links)
- An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules (Q1652386) (← links)
- A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem (Q1665961) (← links)
- LP bounds in various constraint programming approaches for orthogonal packing (Q1761178) (← links)
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint (Q1761795) (← links)
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem (Q1761945) (← links)
- An efficient deterministic heuristic for two-dimensional rectangular packing (Q1762123) (← links)
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem (Q1869488) (← links)
- A variable neighborhood search algorithm for the leather nesting problem (Q1954576) (← links)
- A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems (Q1988631) (← links)
- Spatial scheduling optimization algorithm for block assembly in shipbuilding (Q1992436) (← links)
- The maximum diversity assortment selection problem (Q2040441) (← links)
- Effective loading in combined vehicle routing and container loading problems (Q2108096) (← links)
- 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← links)
- Boosting ant colony optimization via solution prediction and machine learning (Q2147035) (← links)
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing (Q2267317) (← links)
- An open space based heuristic for the 2D strip packing problem with unloading constraints (Q2310581) (← links)
- An efficient heuristic algorithm for two-dimensional rectangular packing problem with central rectangle (Q2338490) (← links)
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering (Q2356195) (← links)
- Exhaustive approaches to 2D rectangular perfect packings (Q2390210) (← links)
- Exact and approximate methods for parallel multiple-area spatial scheduling with release times (Q2393121) (← links)
- On solving multiobjective bin packing problems using evolutionary particle swarm optimization (Q2427181) (← links)
- Improved local search algorithms for the rectangle packing problem with general spatial costs (Q2484340) (← links)
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces (Q2488910) (← links)
- A new heuristic recursive algorithm for the strip rectangular packing problem (Q2489283) (← links)
- L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing (Q2567707) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems (Q2643947) (← 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)
- Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic (Q2643955) (← links)
- A heuristic for the three-dimensional strip packing problem (Q2643958) (← links)
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview (Q2669629) (← links)
- Two dimensional guillotine cutting stock and scheduling problem in printing industry (Q2676408) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem (Q2803256) (← links)