On the role of bottleneck Monge matrices in combinatorial optimization
type: Item
instance of: scholarly article
title: On the role of bottleneck Monge matrices in combinatorial optimization
zbMATH Open document ID: 0836.90127
DOI: 10.1016/0167-6377(95)00003-3
published in: Operations Research Letters
publication date: 1996-05-02T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 829723
zbMATH Keywords: bottleneck Monge property
zbMATH Keywords: flow shop
zbMATH Keywords: minimum makespan
zbMATH Keywords: time transportation
zbMATH Keywords: bottleneck travelling salesman
author: Rainer E. Burkard
MaRDI profile type: Publication
full work available at URL: 0167-6377(95)00003-3
OpenAlex ID: W2036665495
cites work: Q3964287
cites work: Q4191842
cites work: Efficiently solvable special cases of bottleneck travelling salesman problems
cites work: Q3942759
cites work: Q5557602
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: On the recognition of permuted bottleneck Monge matrices
cites work: A concise survey of efficiently solvable special cases of the permutation flow-shop problem
cites work: An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems
description: scientific article; zbMATH DE number 829723