Matthias Knapp

  • Citations Per Year
Learn More
The multiple traveling salesmen problem with moving targets (MTSPMT) is a generalization of the classical traveling salesmen problem (TSP), where the targets (cities or objects) are moving over time. Additionally, for each target a visibility time window is given. The task is to find routes for several salesmen so that each target is reached exactly once(More)
Material master data is much more complex than other master data. Especially in industry, the lack of a common taxonomy leads to two major problems: heterogeneous classification structures on the one hand, and various data content defects on the other. None of the existing standards fits all individual needs which occur in different areas of application. To(More)
  • 1