scientific article
From MaRDI portal
Publication:3048582
zbMath0413.90050MaRDI QIDQ3048582
Aristide Mingozzi, Paolo Toth, Nicos Christofides
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
integer programmingknapsack problemlower boundscomputational resultsbin-packingloading problemsalgorithms with alternative testscombinatorial optimization sensitivity resultsdynamic loading problem
Related Items
The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach, Packing problems, The petrol station replenishment problem with time windows, Lower bounds and algorithms for the minimum cardinality bin covering problem, Scheduling with neural networks -- the case of the Hubble Space Telescope, Heuristics and lower bounds for the bin packing problem with conflicts