Pages that link to "Item:Q1869719"
From MaRDI portal
The following pages link to Algorithms for the variable sized bin packing problem (Q1869719):
Displayed 39 items.
- Vehicle scheduling under the warehouse-on-wheels policy (Q266928) (← links)
- A hybrid heuristic algorithm for the 2D variable-sized bin packing problem (Q296697) (← links)
- A tabu search algorithm for application placement in computer clustering (Q337070) (← links)
- An investigation into two bin packing problems with ordering and orientation implications (Q421577) (← links)
- Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items (Q490206) (← links)
- Relaxations and exact solution of the variable sized bin packing problem (Q535302) (← links)
- ATM VP-based network design (Q596263) (← links)
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (Q610980) (← links)
- An asymptotic approximation scheme for the concave cost bin packing problem (Q933537) (← links)
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555) (← links)
- Heuristics for the variable sized bin-packing problem (Q1017465) (← links)
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
- A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems (Q1711659) (← links)
- A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints (Q1754206) (← links)
- Variable neighbourhood search for the variable sized bin packing problem (Q1762087) (← links)
- Online packing of arbitrary sized items into designated and multipurpose bins (Q2001455) (← links)
- Queue-constrained packing: a vehicle ferry case study (Q2029061) (← links)
- Heuristics for the dynamic facility location problem with modular capacities (Q2029361) (← links)
- A bin packing approach to solve the aircraft maintenance task allocation problem (Q2031115) (← links)
- The vehicle routing problem with heterogeneous locker boxes (Q2033310) (← links)
- Truthful mechanism design for bin packing with applications on cloud computing (Q2084605) (← links)
- Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem (Q2147064) (← links)
- Adaptive simulated annealing with greedy search for the circle bin packing problem (Q2147115) (← links)
- Homogeneous grouping of non-prime steel products for online auctions: a case study (Q2159574) (← links)
- The freight consolidation and containerization problem (Q2256168) (← links)
- Packing items to feed assembly lines (Q2384618) (← links)
- Efficient algorithms for the offline variable sized bin-packing problem (Q2434654) (← links)
- Solving the variable size bin packing problem with discretized formulations (Q2462559) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- Optimum service capacity and demand management with price incentives (Q2655621) (← links)
- Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning (Q2668752) (← links)
- Approximation algorithms for a virtual machine allocation problem with finite types (Q2680235) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning (Q5084621) (← links)
- A desired load distribution model for scheduling of unrelated parallel machines (Q5478812) (← links)
- Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines (Q6049692) (← links)
- An iterated greedy algorithm for the planning of yarn‐dyeing boilers (Q6060692) (← links)
- Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties (Q6081604) (← links)
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts (Q6167663) (← links)