A branch-and-cut algorithm for the profitable windy rural postman problem
Publication:321108
DOI10.1016/j.ejor.2015.10.016zbMath1346.90074OpenAlexW2192217525MaRDI QIDQ321108
Thais Ávila, Isaac Plana, José María Sanchis, Angel Corberán
Publication date: 7 October 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.2015.10.016
Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (8)
Cites Work
- Unnamed Item
- Unnamed Item
- New results for the directed profitable rural postman problem
- A matheuristic for the team orienteering arc routing problem
- The time-dependent prize-collecting arc routing problem
- Plowing with precedence: a variant of the windy postman problem
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem
- An ILP-refined tabu search for the directed profitable rural postman problem
- Local search for the undirected capacitated arc routing problem with profits
- The orienteering problem: a survey
- 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
- A polyhedral approach to the rural postman problem
- The capacitated arc routing problem: Valid inequalities and facets
- Profitable mixed capacitated arc routing and related problems
- Privatized rural postman problems
- An artificial bee colony approach for the undirected capacitated arc routing problem with profits
- Vehicle Routing
- The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
- An algorithm for the Rural Postman problem on a directed graph
- Odd Minimum Cut-Sets and b-Matchings
- Improvement Procedures for the Undirected Rural Postman Problem
- Arc Routing
- A branch & cut algorithm for the windy general routing problem and special cases
- Approximate solutions for the maximum benefit chinese postman problem
- Integer Programming and Combinatorial Optimization
- Modeling the Pre Auction Stage The Truckload Case
This page was built for publication: A branch-and-cut algorithm for the profitable windy rural postman problem