The directed profitable rural postman problem with incompatibility constraints
type: Item
instance of: scholarly article
title: The directed profitable rural postman problem with incompatibility constraints
zbMATH Open document ID: 1403.90096
author: Marco Colombi
author: Renata Mansini
author: Isaac Plana
author: Ángel Corberán
author: José M. Sanchis
published in: European Journal of Operational Research
publication date: 2018-05-29T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 6875883
zbMATH Keywords: routing
zbMATH Keywords: rural postman problem
zbMATH Keywords: incompatibility constraints
zbMATH Keywords: generalized independent set problem
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.02.002
OpenAlex ID: W2587506683
cites work: Solving the prize-collecting rural postman problem
cites work: Privatized rural postman problems
cites work: An ILP-refined tabu search for the directed profitable rural postman problem
cites work: Q5271459
cites work: The stacker crane problem and the directed general routing problem
cites work: A branch-and-cut algorithm for the profitable windy rural postman problem
cites work: Q4762468
cites work: The time-dependent prize-collecting arc routing problem
cites work: The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
cites work: New results for the directed profitable rural postman problem
cites work: The Rural Postman Problem on mixed graphs with turn penalties
cites work: A branch-and-cut algorithm for the maximum benefit Chinese postman problem
cites work: The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
cites work: A Generalized Traveling Salesman Problem Approach to the Directed Clustered Rural Postman Problem
cites work: On the collaboration uncapacitated arc routing problem
cites work: The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
cites work: Modeling the Pre Auction Stage The Truckload Case
cites work: The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
cites work: Approximate solutions for the maximum benefit chinese postman problem
cites work: Probabilistic GRASP-tabu search algorithms for the UBQP problem
DOI: 10.1016/J.EJOR.2017.02.002
description: scientific article; zbMATH DE number 6875883