A large neighborhood search algorithm and lower bounds for the variable-Sized bin packing problem with conflicts
Year of publication: |
2023
|
---|---|
Authors: | Ekici, Ali |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 308.2023, 3 (1.8.), p. 1007-1020
|
Subject: | Item conflicts | Large neighborhood search | Lower bound | Packing | Variable-sized bin packing | Packproblem | Packing problem | Algorithmus | Algorithm | Theorie | Theory | Heuristik | Heuristics |
-
An iterated greedy algorithm for the planning of yarn-dyeing boilers
Demir, Yunus, (2024)
-
A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
Polyakovskiy, Sergey, (2022)
-
A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem
Borgulya, Istvan, (2024)
- More ...
-
An improved model for supplier selection under capacity constraint and multiple criteria
Ekici, Ali, (2013)
-
Dimension reduction and coefficient estimation in multivariate linear regression
Yuan, Ming, (2007)
-
Multiple agents maximum collection problem with time dependent rewards
Ekici, Ali, (2013)
- More ...