Lane covering with partner bounds in collaborative truckload transportation procurement
type: Item
instance of: scholarly article
title: Lane covering with partner bounds in collaborative truckload transportation procurement
zbMATH Open document ID: 1391.90069
author: Gültekin Kuyzu
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6901260
zbMATH Keywords: lane covering
zbMATH Keywords: collaboration
zbMATH Keywords: transportation
zbMATH Keywords: column generation
zbMATH Keywords: branch-and-price
MaRDI profile type: Publication
full work available at URL: j.cor.2016.07.018
OpenAlex ID: W2486102764
cites work: Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand
cites work: Improved lower bounds and exact algorithm for the capacitated arc routing problem
cites work: Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
cites work: Stabilized column generation
cites work: Shipper collaboration
cites work: Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
cites work: On characterization of the core of lane covering games via dual solutions
cites work: The bounded cycle-cover problem
cites work: STACS 2005
cites work: Selected Topics in Column Generation
cites work: Variable neighborhood search
cites work: On the Complexity of Finding a Minimum Cycle Cover of a Graph
DOI: 10.1016/J.COR.2016.07.018
description: scientific article; zbMATH DE number 6901260