Pages that link to "Item:Q1761945"
From MaRDI portal
The following pages link to A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem (Q1761945):
Displaying 27 items.
- A hybrid evolutionary algorithm for the two-dimensional packing problem (Q301327) (← links)
- A simple randomized algorithm for two-dimensional strip packing (Q339530) (← links)
- Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm (Q342027) (← links)
- A skyline heuristic for the 2D rectangular packing and strip packing problems (Q421662) (← links)
- Scheduling with job-rejection and position-dependent processing times on proportionate flowshops (Q523188) (← links)
- Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← 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)
- Model and algorithm for container allocation problem with random freight demands in synchromodal transportation (Q1667146) (← links)
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem (Q1869488) (← links)
- Two-dimensional knapsack-block packing problem (Q1984921) (← links)
- Grids for cutting and packing problems: a study in the 2D knapsack problem (Q2025135) (← links)
- Minmax scheduling and due-window assignment with position-dependent processing times and job rejection (Q2026708) (← links)
- Queue-constrained packing: a vehicle ferry case study (Q2029061) (← links)
- A comparative analysis of two matheuristics by means of merged local optima networks (Q2029302) (← links)
- The maximum diversity assortment selection problem (Q2040441) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Designing vehicle routes for a mix of different request types, under time windows and loading constraints (Q2355860) (← links)
- An EDA for the 2D knapsack problem with guillotine constraint (Q2418151) (← links)
- An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery (Q2669556) (← links)
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container (Q2673561) (← links)
- Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When? (Q3304189) (← links)
- A morph-based simulated annealing heuristic for a modified bin-packing problem (Q4363746) (← links)
- An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem (Q5058727) (← links)
- Rectangle packing with a recursive pilot method (Q6065652) (← links)
- Automated placement of analog integrated circuits using priority-based constructive heuristic (Q6568458) (← links)
- A skyline-based heuristic for orthogonal packing rectangles in a circle (Q6568481) (← links)
