The directed profitable location rural postman problem

DOI10.1016/j.ejor.2013.07.018zbMath1304.90029OpenAlexW1999870331MaRDI QIDQ2514733

Yanyan Li

Publication date: 3 February 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.07.018

zbMATH Keywords

integer programmingfacility locationrural postman problemarc routing with profitsfreight transportation

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Related Items (1)

Arc routing problems: A review of the past, present, and future

Cites Work

• An ILP-refined tabu search for the directed profitable rural postman problem
• The undirected capacitated arc routing problem with profits
• Solving the prize-collecting rural postman problem
• A polyhedral approach to the rural postman problem
• An algorithm for the Rural Postman problem on a directed graph
• The Capacitated Arc Routing Problem: Lower bounds
• A fundamental problem in vehicle routing
• Improvement Procedures for the Undirected Rural Postman Problem
• Arc Routing Problems, Part II: The Rural Postman Problem
• Eulerian location problems
• A Selection Problem of Shared Fixed Costs and Network Flows

This page was built for publication: The directed profitable location rural postman problem