Solving the prize-collecting rural postman problem
type: Item
instance of: scholarly article
title: Solving the prize-collecting rural postman problem
zbMATH Open document ID: 1176.90411
author: Julián Aráoz
author: Elena Fernández
author: Oscar Meza
published in: European Journal of Operational Research
publication date: 2009-12-07T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5642751
zbMATH Keywords: integer programming
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: arc routing problems
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.ejor.2008.04.037
OpenAlex ID: W2018139583
cites work: Reductions to 1–matching polyhedra
cites work: Privatized rural postman problems
cites work: On the cycle polytope of a binary matroid
cites work: The capacitated arc routing problem: Valid inequalities and facets
cites work: Q4762468
cites work: A cutting plane algorithm for the general routing problem
cites work: Min-Max K -vehicles windy rural postman problem
cites work: A branch & cut algorithm for the windy general routing problem and special cases
cites work: A polyhedral approach to the rural postman problem
cites work: The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
cites work: The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
cites work: Q4510100
cites work: On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation
cites work: Outline of an algorithm for integer solutions to linear programs
cites work: A branch-and-cut algorithm for the undirected rural postman problem
cites work: Multi-Terminal Network Flows
cites work: A cutting plane algorithm for minimum perfect 2-matchings
cites work: Improvement Procedures for the Undirected Rural Postman Problem
cites work: Integer Programming and Combinatorial Optimization
cites work: Odd Minimum Cut-Sets and b-Matchings
DOI: 10.1016/J.EJOR.2008.04.037
description: scientific article; zbMATH DE number 5642751