A time minimising transportation problem with quantity dependent time
type: Item
instance of: scholarly article
title: A time minimising transportation problem with quantity dependent time
zbMATH Open document ID: 0455.90056
DOI: 10.1016/0377-2217(81)90351-9
author: K. K. Achary
author: C. R. Seshan
published in: European Journal of Operational Research
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C08
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3713484
zbMATH Keywords: time minimising transportation problem
zbMATH Keywords: quantity dependent time
zbMATH Keywords: threshold algorithm
zbMATH Keywords: upper bounding technique
zbMATH Keywords: primal dual approach
zbMATH Keywords: branch and bound algorithm
zbMATH Keywords: computation of minimum bottleneck shipment
MaRDI profile type: Publication
full work available at URL: 0377-2217(81)90351-9
OpenAlex ID: W2016440292
cites work: Transportation type problems with quantity discounts
cites work: A procedure for time minimization transportation problem
cites work: An augmenting path method for solving linear bottleneck transportation problems
cites work: The bottleneck transportation problem
cites work: Time‐minimizing transportation problems
cites work: Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem”
cites work: Q4039868
cites work: Some remarks on the time transportation problem
description: scientific article; zbMATH DE number 3713484