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):
Displayed 10 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)
- 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)
- Two-dimensional knapsack-block packing problem (Q1984921) (← 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)