The undirected capacitated arc routing problem with profits
DOI10.1016/J.COR.2009.05.005zbMATH Open1188.90024OpenAlexW2085543268MaRDI QIDQ975994FDOQ975994
Authors: B. E. Eshmatov 
Publication date: 11 June 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.05.005
Recommendations
- Local search for the undirected capacitated arc routing problem with profits
- The undirected capacitated general routing problem with profits
- Profitable mixed capacitated arc routing and related problems
- scientific article; zbMATH DE number 6741969
- The capacitated arc routing problem. A heuristic algorithm
heuristicscarrierbranch-and-priceauctions in transportationundirected capacitated arc routing with profits
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- Future paths for integer programming and links to artificial intelligence
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- The vehicle routing problem
- A Primer in Column Generation
- The team orienteering problem
- Solving the prize-collecting rural postman problem
- Privatized rural postman problems
- Title not available (Why is that?)
- The capacitated team orienteering and profitable tour problems
- Title not available (Why is that?)
- A TABU search heuristic for the team orienteering problem
- A cutting plane algorithm for the capacitated arc routing problem
- An exact algorithm for team orienteering problems
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A heuristic for the multiple tour maximum collection problem
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
- Title not available (Why is that?)
- New Refinements for the Solution of Vehicle Routing Problems with Branch and Price
Cited In (17)
- An artificial bee colony approach for the undirected capacitated arc routing problem with profits
- The orienteering problem: a survey
- The parking warden tour problem
- City streets parking enforcement inspection decisions: the Chinese postman's perspective
- Capacitated ring arborescence problems with profits
- An updated annotated bibliography on arc routing problems
- Local search for the undirected capacitated arc routing problem with profits
- Arc routing problems: A review of the past, present, and future
- Title not available (Why is that?)
- A matheuristic for the team orienteering arc routing problem
- Efficient metaheuristics for the mixed team orienteering problem with time windows
- A branch-and-cut algorithm for the profitable windy rural postman problem
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem
- A scatter search algorithm for time-dependent prize-collecting arc routing problems
- Customer selection and profit maximization in vehicle routing problems
- The directed profitable location rural postman problem
- Profitable mixed capacitated arc routing and related problems
Uses Software
This page was built for publication: The undirected capacitated arc routing problem with profits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975994)
