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 0030-3623, 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 | Graphentheorie | Graph theory | Packproblem | Packing problem | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem |
-
Heuristic algorithms for the 2-period balanced Travelling Salesman Problem in Euclidean graphs
Bassetto, Tatiana, (2011)
-
A new heuristic for detecting non-hamiltonicity in cubic graphs
Filar, Jerzy A., (2014)
-
A minimum spanning tree based heuristic for the travelling salesman tour
Kumar, Santosh, (2018)
- More ...
-
Lenz, Ralf, (2021)
-
Seidl, David, (2010)
-
An outlook on behavioural OR – three tasks, three pitfalls, one definition
Becker, Kai Helge, (2016)
- More ...