An investigation into two bin packing problems with ordering and orientation implications
From MaRDI portal
Publication:421577
DOI10.1016/j.ejor.2011.03.016zbMath1237.90202OpenAlexW2030527251MaRDI QIDQ421577
Publication date: 14 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://orca.cf.ac.uk/11082/1/Lewis%2C_R_Investigation_into_2_Bin_PackPaper.pdf
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Exact and approximate methods for the score-constrained packing problem, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, Metaheuristics for truck loading in the car production industry, Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes, The one-dimensional cutting stock problem with sequence-dependent cut losses
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling in sports: an annotated bibliography
- Lower bounds and reduction procedures for the bin packing problem
- Variable space search for graph coloring
- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
- Heuristics for the variable sized bin-packing problem
- Near-optimal solutions to one-dimensional cutting stock problems
- Some models of graphs for scheduling sports competitions
- Heuristic algorithms for the multiple knapsack problem
- Cutting stock problems and solution procedures
- An analytical comparison of different formulations of the travelling salesman problem
- Algorithms for the variable sized bin packing problem
- Computer science today. Recent trends and developments
- Round robin scheduling -- a survey
- A survey of metaheuristic-based techniques for university timetabling problems
- An improved typology of cutting and packing problems
- Accelerating column generation for variable sized bin-packing problems
- Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
- Integer Programming Formulation of Traveling Salesman Problems
- Ant colony optimization and local search for bin packing and cutting stock problems
- 25 pretty graph colouring problems
- A study of permutation operators for minimum span frequency assignment using an order based representation
