Shipper collaboration
type: Item
instance of: scholarly article
title: Shipper collaboration
zbMATH Open document ID: 1163.90363
author: Gültekin Kuyzu
author: Özlem Ergun
author: Martin W. P. Savelsbergh
published in: Computers \& Operations Research
publication date: 2007-01-09T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 5082733
MaRDI profile type: Publication
full work available at URL: j.cor.2005.07.026
OpenAlex ID: W4255901486
cites work: Arc Routing Problems, Part I: The Chinese Postman Problem
cites work: On the Complexity of Finding a Minimum Cycle Cover of a Graph
cites work: Covering Graphs by Simple Circuits
cites work: Shortest coverings of graphs with cycles
cites work: Covering Multigraphs by Simple Circuits
cites work: Cycle covering in bridgeless graphs
cites work: Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4
cites work: Covering Graphs by Cycles
cites work: Covering a graph with cycles.
DOI: 10.1016/J.COR.2005.07.026
description: scientific article; zbMATH DE number 5082733