Solution structures and sensitivity of special assignment problems

DOI10.1016/0305-0548(84)90040-6zbMath0608.90069OpenAlexW1971579872MaRDI QIDQ1086156

Yigal Gerchak, H. A. Eiselt

Publication date: 1984

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(84)90040-6

zbMATH Keywords

transportationoptimal solutionsbottleneckSensitivity analysisAssignmentspecial cost structures

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (4)

Single-machine sequencing with controllable processing times ⋮ Bottleneck flows in unit capacity networks ⋮ Sensitivity analysis of the optimal assignment. ⋮ Two parallel machine sequencing problems involving controllable job processing times

Cites Work

• On self-organizing sequential search heuristics
• Bottleneck extrema
• The bottleneck transportation problem
• Unnamed Item

This page was built for publication: Solution structures and sensitivity of special assignment problems