Homogeneous grouping of non-prime steel products for online auctions: a case study
From MaRDI portal
Publication:2159574
Recommendations
- Grouping products for the optimization of production processes: a case in the steel manufacturing industry
- Product grouping for batch processes
- A Practical Solution to a Cargo Loading Problem at Bethlehem Steel
- The slab design problem in the steel industry
- Integrated charge batching and casting width selection at Baosteel
Cites work
- A 5/4 linear time bin packing algorithm
- A branch-and-price algorithm for the bin packing problem with conflicts
- A generalized bin packing problem for parcel delivery in last-mile logistics
- A hybrid metaheuristic for the two-dimensional strip packing problem
- A new proof for the first-fit decreasing bin-packing algorithm
- A note on a variant of the online open end bin packing problem
- A simulated annealing hyper-heuristic methodology for flexible decision support
- A three-dimensional bin-packing model: exact multicriteria solution and computational complexity
- A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
- A variable neighborhood descent approach for the two-dimensional bin packing problem
- Algorithms for the bin packing problem with conflicts
- Algorithms for the variable sized bin packing problem
- An approximation scheme for bin packing with conflicts
- An effective heuristic for the two-dimensional irregular bin packing problem
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Analysis of a Compound Bin Packing Algorithm
- Approximation algorithms for combinatorial problems
- Assembly line balancing as generalized bin packing
- Banks' business models in the euro area: a cluster analysis in high dimensions
- Bin packing problem with conflicts and item fragmentation
- Bin packing problems with rejection penalties and their dual problems
- Bin packing with divisible item sizes
- Bison
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Bounded space on-line bin packing: Best is better than first
- Cardinality constrained bin-packing problems
- Cluster analysis. A survey
- Clustering: a neural network approach
- DILS
- DILS: constrained clustering through dual iterative local search
- Dynamic Bin Packing
- Fair versus unrestricted bin packing
- Fast algorithms for bin packing
- Heuristics and lower bounds for the bin packing problem with conflicts
- Heuristics for solving the bin-packing problem with conflicts
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 910900 (Why is no real title available?)
- Linear programming formulation of the vertex colouring problem
- Mixture model modal clustering
- New Algorithms for Bin Packing
- New methods to color the vertices of a graph
- On Bin Packing with Conflicts
- On the generalized bin packing problem
- On-line bin packing with two item sizes
- Online bin packing of fragile objects with application in cellular networks
- Online bin packing of squares and cubes
- Online bin packing with cardinality constraints resolved
- Repacking helps in bounded space on-line bin-packing
- Scheduling space-sharing for internet advertising
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
- The transportation problem with conflicts
This page was built for publication: Homogeneous grouping of non-prime steel products for online auctions: a case study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2159574)
