On the role of bottleneck Monge matrices in combinatorial optimization

DOI10.1016/0167-6377(95)00003-3MaRDI QIDQ1904608zbMATH OpenOpenAlexFDO

Authors 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

bottleneck Monge propertybottleneck travelling salesmanflow shopminimum makespantime transportation

Mathematics Subject Classification ID

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

Recommendations

• Perspectives of Monge properties in optimization
• Monge matrices make maximization manageable
• On the recognition of permuted bottleneck Monge matrices
• The algebraic Monge property and path problems
• scientific article; zbMATH DE number 1929930

Cites work

• A concise survey of efficiently solvable special cases of the permutation flow-shop problem
• An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems
• Efficiently solvable special cases of bottleneck travelling salesman problems
• scientific article; zbMATH DE number 3759934 (Why is no real title available?)
• scientific article; zbMATH DE number 3786461 (Why is no real title available?)
• scientific article; zbMATH DE number 3630467 (Why is no real title available?)
• scientific article; zbMATH DE number 3272833 (Why is no real title available?)
• On the recognition of permuted bottleneck Monge matrices
• Optimal two- and three-stage production schedules with set-up time included

Cited in

(6)

• The algebraic Monge property and path problems
• Trapezoidal matrices and the bottleneck assignment problem
• On the recognition of permuted bottleneck Monge matrices
• Perspectives of Monge properties in optimization
• Monge properties, discrete convexity and applications
• Technical note -- A Monge sequence-based approach to characterize the competitive newsvendor problem

This page was built for publication: On the role of bottleneck Monge matrices in combinatorial optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1904608)