Homogeneous grouping of non-prime steel products for online auctions: a case study
DOI10.1007/S10479-022-04677-5zbMATH Open1496.90073OpenAlexW4226327155WikidataQ114227569 ScholiaQ114227569MaRDI QIDQ2159574FDOQ2159574
Paolo Priore, Diego Diaz, Borja Ponte, Borja Ena, Alberto Gomez
Publication date: 1 August 2022
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-022-04677-5
greedy algorithmbin packing problemonline auctionssteel industrydistance-based heuristicsFIFO algorithm
Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Bison
- DILS: constrained clustering through dual iterative local search
- DILS
- Approximation algorithms for combinatorial problems
- Repacking helps in bounded space on-line bin-packing
- Heuristics and lower bounds for the bin packing problem with conflicts
- Algorithms for the variable sized bin packing problem
- Cardinality constrained bin-packing problems
- Algorithms for the bin packing problem with conflicts
- On Bin Packing with Conflicts
- Fair versus unrestricted bin packing
- Assembly line balancing as generalized bin packing
- New methods to color the vertices of a graph
- A simulated annealing hyper-heuristic methodology for flexible decision support
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Fast algorithms for bin packing
- Analysis of a Compound Bin Packing Algorithm
- Dynamic Bin Packing
- New Algorithms for Bin Packing
- A hybrid metaheuristic for the two-dimensional strip packing problem
- A variable neighborhood descent approach for the two-dimensional bin packing problem
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
- Bin packing problem with conflicts and item fragmentation
- An effective heuristic for the two-dimensional irregular bin packing problem
- An approximation scheme for bin packing with conflicts
- Bin packing with divisible item sizes
- A 5/4 linear time bin packing algorithm
- A new proof for the first-fit decreasing bin-packing algorithm
- Online bin packing of fragile objects with application in cellular networks
- On the generalized bin packing problem
- Clustering: a neural network approach
- Bounded space on-line bin packing: Best is better than first
- A branch-and-price algorithm for the bin packing problem with conflicts
- A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
- Scheduling space-sharing for internet advertising
- The transportation problem with conflicts
- Bin packing problems with rejection penalties and their dual problems
- Cluster analysis. A survey
- Linear programming formulation of the vertex colouring problem
- Heuristics for solving the bin-packing problem with conflicts
- A generalized bin packing problem for parcel delivery in last-mile logistics
- Mixture model modal clustering
- A note on a variant of the online open end bin packing problem
- Online bin packing with cardinality constraints resolved
- Banks' business models in the euro area: a cluster analysis in high dimensions
- A three-dimensional bin-packing model: exact multicriteria solution and computational complexity
- Online bin packing of squares and cubes
Uses Software
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)
