The Loading Problem

DOI10.1287/mnsc.17.5.259zbMath0208.45701OpenAlexW2125554210MaRDI QIDQ5608991

Samuel Eilon, Nicos Christofides

Publication date: 1971

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.17.5.259

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items

Worst-case analysis of a new heuristic for the travelling salesman problem, A heuristic routine for solving large loading problems, An analysis of lower bound procedures for the bin packing problem, A graph coloring algorithm for large scale scheduling problems, Bin packing problems in one dimension: Heuristic solutions and confidence intervals, Bin packing and cutting stock problems: mathematical models and exact algorithms, BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem, Approximation and online algorithms for multidimensional bin packing: a survey, An iterated greedy algorithm for the planning of yarn‐dyeing boilers, A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics, Priority-based bin packing with subset constraints, Lower bounds and reduction procedures for the bin packing problem, A multiobjective optimization algorithm to solve the part feeding problem in mixed-model assembly lines, Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver, Packing problems, An application of the multiple knapsack problem: the self-sufficient marine, Mathematical models and decomposition methods for the multiple knapsack problem, Modeling and algorithmic development of a staff scheduling problem, Lower bounds and algorithms for the 2-dimensional vector packing problem, A fast algorithm for two-dimensional pallet loading problems of large size, Bin packing problem with conflicts and item fragmentation, A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems, A typology of cutting and packing problems, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, A Comparative Study of Multi-objective Evolutionary Algorithms for the Bi-objective 2-Dimensional Vector Packing Problem, The one-dimensional cutting stock problem with usable leftovers -- a survey