Elisabeth Gaar,Markus Sinnl
Elisabeth Gaar
The discrete α-neighbor p-center problem (d-α-pCP) is an emerging variant of the classical p-center problem which recently got attention in literature. In this problem, we are given a discrete set of points and we need to locate p...
Secure and efficient routing on nodes, edges, and arcs of simple-graphs and of multi-graphs [0.03%]
简单图和多图中节点、边和弧上的安全高效路由算法
Georg E A Fröhlich,Karl F Doerner,Margaretha Gansterer
Georg E A Fröhlich
Many security companies offer patrolling services, such that guards inspect facilities or streets on a regular basis. Patrolling routes should be cost efficient, but the inspection patterns should not be predictable for offenders. We introd...
The cost of incentive compatibility in auction-based mechanisms for carrier collaboration [0.03%]
激励相容在基于拍卖机制的航空公司合作中的成本研究
Margaretha Gansterer,Richard F Hartl,Rudolf Vetschera
Margaretha Gansterer
Collaboration has been one of the important trends in vehicle routing. A typical mechanism to enable carrier collaboration is to use combinatorial auctions, where requests are not traded individually but are combined into bundles. Previous ...
Michael Bögl,Karl F Doerner,Sophie N Parragh
Michael Bögl
In this article, we study the school bus routing and scheduling problem with transfers arising in the field of nonperiodic public transportation systems. It deals with the transportation of pupils from home to their school in the morning ta...