City streets parking enforcement inspection decisions: the Chinese postman's perspective
From MaRDI portal
Publication:726240
DOI10.1016/j.ejor.2014.10.039zbMath1341.90139OpenAlexW2012712047MaRDI QIDQ726240
Nichalin S. Summerfield, Moshe Dror, Morris A. Cohen
Publication date: 8 July 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.10.039
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Cites Work
- Unnamed Item
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem
- The undirected capacitated arc routing problem with profits
- Solving the prize-collecting rural postman problem
- The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
- Recent results on Arc Routing Problems: An annotated bibliography
- The Multi-Armed Bandit Problem: Decomposition and Computation
- On the complexity of edge traversing
- Networks and vehicle routing for municipal waste collection
- Approximate solutions for the maximum benefit chinese postman problem