Discrete cutting path problems : a general solution framework and industrial applications
Year of publication: |
2025
|
---|---|
Authors: | Khachai, Daniil ; Battaïa, Olga ; Petunin, Alexander ; Chačaj, Michail Ju. |
Published in: |
International journal of production research. - London [u.a.] : Taylor & Francis, ISSN 1366-588X, ZDB-ID 1485085-0. - Vol. 63.2025, 3, p. 949-969
|
Subject: | Cutting path problem | industry | adaptive large neighbourhood search | branch-and-cut algorithm | precedence constrained generalised travelling salesman problem | endpoint cutting problem | innovation and infrastructure | Theorie | Theory | Algorithmus | Algorithm | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Mathematische Optimierung | Mathematical programming |
-
Tool path optimisation method for large thin-wall part of spacecraft
Wang, Haichao, (2018)
-
Models and algorithms for the Traveling Salesman Problem with Time-dependent Service times
Cacchiani, Valentina, (2020)
-
The family capacitated vehicle routing problem
Bernardino, Raquel, (2024)
- More ...
-
Khachai, Daniil, (2023)
-
A taxonomy of line balancing problems and their solutionapproaches
Battaïa, Olga, (2013)
-
A taxonomy of line balancing problems and their solutionapproaches
Battaïa, Olga, (2013)
- More ...