Minimum deviation problems

DOI10.1016/0167-6377(88)90029-6zbMath0646.90070OpenAlexW2013863738MaRDI QIDQ1104246

S. K. Gupta, Abraham P. Punnen

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0167-6377(88)90029-6

zbMATH Keywords

shortest pathspanning treeparametric analysisbalanced optimizationweighted matroid intersectionbottleneck linear programsMinimum Deviation Assignment ProblemMinimum Deviation ProblemMinsum problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Linear programming (90C05) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (13)

On combined minmax-minsum optimization ⋮ Assignment problems: a golden anniversary survey ⋮ Minimum dispersion problems ⋮ On discrete optimization with ordering ⋮ k-sum optimization problems ⋮ On the generality of the greedy algorithm for solving matroid base problems ⋮ Ordered weighted average optimization in multiobjective spanning tree problem ⋮ The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases ⋮ Uncertain random assignment problem ⋮ An \(O(m\log n)\) algorithm for the max+sum spanning tree problem ⋮ A Survey on Multiple Objective Minimum Spanning Tree Problems ⋮ Minimum deviation and balanced optimization: A unified approach ⋮ Computing Euclidean bottleneck matchings in higher dimensions

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Balanced optimization problems
• A min-max problem as a linear programming problem
• Parametric analysis of linear programs with upper bounded variables

This page was built for publication: Minimum deviation problems