A hybrid algorithm for constrained order packing
Year of publication: |
2014
|
---|---|
Authors: | Furian, Nikolaus ; Vössner, Siegfried |
Published in: |
Central European journal of operations research : CEJOR ; official journal of the Austrian, Croatian, Czech, Hungarian, Slovakian and Slovenian OR Societies. - Berlin : Springer, ISSN 1435-246X, ZDB-ID 1178875-6. - Vol. 22.2014, 1, p. 157-186
|
Subject: | Bin packing | Constraints | Heuristics | Shortest path | Heuristik | Algorithmus | Algorithm | Theorie | Theory | Packproblem | Packing problem | Operations Research | Operations research | Evolutionärer Algorithmus | Evolutionary algorithm |
-
A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems
Wei, Lijun, (2020)
-
Algorithms for the two dimensional bin packing problem with partial conflicts
Hamdi-Dhaoui, Khaoula, (2012)
-
A genetic algorithm for two-dimensional bin packing with due dates
Bennell, Julia A., (2013)
- More ...
-
Constrained order packing : comparison of heuristic approaches for a new bin packing problem
Furian, Nikolaus, (2013)
-
Constrained order packing : comparison of heuristic approaches for a new bin packing problem
Furian, Nikolaus, (2013)
-
A machine learning-based branch and price algorithm for a sampled vehicle routing problem
Furian, Nikolaus, (2021)
- More ...