A heuristic for the Minimum Score Separation Problem, a combinatorial problem associated with the cutting stock problem
| Year of publication: |
August 2015
|
|---|---|
| Authors: | Becker, Kai Helge ; Appa, Gautam |
| Published in: |
Journal of the Operational Research Society : OR. - Basingstoke, Hampshire : Palgrave, ISSN 0160-5682, ZDB-ID 716033-1. - Vol. 66.2015, 8, p. 1297-1311
|
| Subject: | cutting stock problem | bin packing | heuristics | netoworks and graphs | Travelling Salesman Problem | alternating Hamiltonian path | threshold graph | Heuristik | Heuristics | Packproblem | Packing problem | Graphentheorie | Graph theory | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem |
-
Last-mile shared delivery : a discrete sequential packing approach
Cao, Junyu, (2020)
-
Neamatian Monemi, Rahimeh, (2025)
-
Heuristic algorithms for the 2-period balanced Travelling Salesman Problem in Euclidean graphs
Bassetto, Tatiana, (2011)
- More ...
-
Lenz, Ralf, (2021)
-
Lenz, Ralf, (2022)
-
Seidl, David, (2010)
- More ...