Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches
Year of publication: |
2021
|
---|---|
Authors: | Baykasoğlu, Adil ; Özbel, Burcu Kubur |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 128.2021, p. 1-23
|
Subject: | One-dimensional cutting stock problem | Mixed integer linear programming | Stochastic diffusion search algorithm | Leftovers | Marble industry | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Packproblem | Packing problem | Algorithmus | Algorithm |
-
Mathematical models and exact algorithms for the Colored Bin Packing Problem
Borges, Yulle G. F., (2024)
-
Solving an one-dimensional cutting stock problem by simulated annealing and tabu search
Jahromi, Meghdad HMA, (2012)
-
Aliano Filho, Angelo, (2018)
- More ...
-
Explicit flow-risk allocation for cooperative maximum flow problems under interval uncertainty
Baykasoğlu, Adil, (2021)
-
Complexity and performance measurement for retail supply chains
Ekinci, Esra, (2019)
-
MEPAR-miner: Multi-expression programming for classification rule mining
Baykasoğlu, Adil, (2007)
- More ...