Pages that link to "Item:Q3842995"
From MaRDI portal
The following pages link to The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP (Q3842995):
Displayed 24 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Bin packing and related problems: general arc-flow formulation with graph compression (Q342316) (← links)
- A simulated annealing hyper-heuristic methodology for flexible decision support (Q427562) (← links)
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem (Q531429) (← links)
- A new destructive bounding scheme for the bin packing problem (Q610978) (← links)
- New bin packing fast lower bounds (Q883309) (← links)
- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing (Q1013410) (← links)
- Two heuristics for the one-dimensional bin-packing problem (Q1018262) (← links)
- BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Characterizing the optimality gap and the optimal packings for the bin packing problem (Q2017826) (← links)
- New symmetry-less ILP formulation for the classical one dimensional bin-packing problem (Q2019488) (← links)
- Solving robust bin-packing problems with a branch-and-price approach (Q2060393) (← links)
- Homogeneous grouping of non-prime steel products for online auctions: a case study (Q2159574) (← links)
- An enhanced grasshopper optimization algorithm to the Bin packing problem (Q2199919) (← links)
- Solving the one-dimensional bin packing problem with a weight annealing heuristic (Q2468485) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects (Q2803261) (← links)
- Constrained circles packing test problems: all the optimal solutions known (Q3066942) (← links)
- A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations (Q5140720) (← links)
- Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB) (Q5189096) (← links)
- Systematic reviews as a metaknowledge tool: caveats and a review of available options (Q6056869) (← links)
- Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems (Q6095737) (← links)
- The bin covering with delivery problem, extended investigations for the online case (Q6100671) (← links)