The directed profitable rural postman problem with incompatibility constraints

DOI10.1016/J.EJOR.2017.02.002zbMATH Open1403.90096OpenAlexW2587506683MaRDI QIDQ1753601FDOQ1753601

Authors: Marco Colombi, Renata Mansini, Isaac Plana, Ángel Corberán, José M. Sanchis 

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

Recommendations

• New results for the directed profitable rural postman problem
• The directed profitable location rural postman problem
• The Directed Rural Postman Problem with Turn Penalties
• Privatized rural postman problems
• An ILP-refined tabu search for the directed profitable rural postman problem

zbMATH Keywords

routingrural postman problemgeneralized independent set problemincompatibility constraints

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)

Cites Work

• Probabilistic GRASP-tabu search algorithms for the UBQP 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
• Privatized rural postman problems
• New results for the directed profitable rural postman problem
• The time-dependent prize-collecting arc routing problem
• An ILP-refined tabu search for the directed profitable rural postman problem
• Modeling the Pre Auction Stage The Truckload Case
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Rural Postman Problem on mixed graphs with turn penalties
• 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
• A branch-and-cut algorithm for the maximum benefit Chinese postman problem
• Approximate solutions for the maximum benefit chinese postman problem
• The stacker crane problem and the directed general routing problem
• On the collaboration uncapacitated arc routing problem
• A Generalized Traveling Salesman Problem Approach to the Directed Clustered Rural Postman Problem
• The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
• The directed profitable rural postman problem with incompatibility constraints

Cited In (9)

• Solving the set covering problem with conflicts on sets: a new parallel GRASP
• Pickup and delivery problem with incompatibility constraints
• The directed profitable rural postman problem with incompatibility constraints
• An ILP-refined tabu search for the directed profitable rural postman problem
• 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 location rural postman problem
• Privatized rural postman problems

Uses Software

• CPLEX

This page was built for publication: The directed profitable rural postman problem with incompatibility constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753601)