Pages that link to "Item:Q1746064"
From MaRDI portal
The following pages link to BPPLIB: a library for bin packing and cutting stock problems (Q1746064):
Displaying 24 items.
- BPPLIB (Q35647) (← links)
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- An empirical analysis of exact algorithms for the unbounded knapsack problem (Q1735169) (← links)
- LP models for bin packing and cutting stock problems (Q1847189) (← links)
- New symmetry-less ILP formulation for the classical one dimensional bin-packing problem (Q2019488) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← links)
- Improved flow-based formulations for the skiving stock problem (Q2333124) (← links)
- A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems (Q2643947) (← links)
- Capping methods for the automatic configuration of optimization algorithms (Q2669790) (← links)
- Exact solution of network flow models with strong relaxations (Q2689828) (← links)
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
- The Meet-in-the-Middle Principle for Cutting and Packing Problems (Q5137950) (← links)
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)
- Cutting and packing problems under uncertainty: literature review and classification framework (Q6056892) (← links)
- Heuristic algorithms based on column generation for an online product shipping problem (Q6065593) (← links)
- Lower and upper bounding procedures for the bin packing problem with concave loading cost (Q6069214) (← links)
- Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems (Q6069740) (← links)
- Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry (Q6106482) (← links)
- The transportation problem with packing constraints (Q6106585) (← links)
- Trolley optimisation for loading printed circuit board components (Q6620758) (← links)
- Local-search based heuristics for advertisement scheduling (Q6658437) (← links)