The directed profitable rural postman problem with incompatibility constraints
From MaRDI portal
Publication:1753601
DOI10.1016/j.ejor.2017.02.002zbMath1403.90096OpenAlexW2587506683MaRDI QIDQ1753601
Renata Mansini, Isaac Plana, Marco Colombi, José María Sanchis, Angel Corberán
Publication date: 29 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.02.002
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items (5)
Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand ⋮ Minimum cost flow problem with conflicts ⋮ The family traveling salesman problem with incompatibility constraints ⋮ The directed profitable rural postman problem with incompatibility constraints ⋮ Pickup and delivery problem with incompatibility constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- New results for the directed profitable rural postman problem
- The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
- A branch-and-cut algorithm for the profitable windy rural postman problem
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- The time-dependent prize-collecting arc routing problem
- On the collaboration uncapacitated arc routing 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
- Solving the prize-collecting rural postman problem
- The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
- The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
- The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
- The directed profitable rural postman problem with incompatibility constraints
- Privatized rural postman problems
- A Generalized Traveling Salesman Problem Approach to the Directed Clustered Rural Postman Problem
- The stacker crane problem and the directed general routing problem
- Approximate solutions for the maximum benefit chinese postman problem
- Modeling the Pre Auction Stage The Truckload Case
- The Rural Postman Problem on mixed graphs with turn penalties
This page was built for publication: The directed profitable rural postman problem with incompatibility constraints