On the role of bottleneck Monge matrices in combinatorial optimization

DOI10.1016/0167-6377(95)00003-3zbMath0836.90127OpenAlexW2036665495MaRDI QIDQ1904608

Rainer E. Burkard

Publication date: 2 May 1996

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(95)00003-3

zbMATH Keywords

flow shopminimum makespantime transportationbottleneck Monge propertybottleneck travelling salesman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items

Technical Note—A Monge Sequence-Based Approach to Characterize the Competitive Newsvendor Problem ⋮ Perspectives of Monge properties in optimization ⋮ Monge properties, discrete convexity and applications

Cites Work

• Efficiently solvable special cases of bottleneck travelling salesman problems
• An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems
• On the recognition of permuted bottleneck Monge matrices
• Optimal two- and three-stage production schedules with setup times included
• A concise survey of efficiently solvable special cases of the permutation flow-shop problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item