Minimum deviation problems

DOI10.1016/0167-6377(88)90029-6MaRDI QIDQ1104246zbMATH OpenOpenAlexFDO

Authors 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

balanced optimizationbottleneck linear programsMinimum Deviation Assignment ProblemMinimum Deviation ProblemMinsum problemparametric analysisshortest pathspanning treeweighted matroid intersection

Mathematics Subject Classification ID

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

Recommendations

• Minimum dispersion problems
• Minimum deviation and balanced optimization: A unified approach
• k-sum optimization problems
• scientific article; zbMATH DE number 93515
• scientific article; zbMATH DE number 4130203

Cites work

• A min-max problem as a linear programming problem
• A note on two problems in connexion with graphs
• Balanced optimization problems
• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Parametric analysis of linear programs with upper bounded variables

Cited in

(14)

• An O(m n) algorithm for the max+sum spanning tree problem
• On combined minmax-minsum optimization
• Minimum dispersion problems
• Computing Euclidean bottleneck matchings in higher dimensions
• 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
• A Survey on Multiple Objective Minimum Spanning Tree Problems
• On discrete optimization with ordering
• On the generality of the greedy algorithm for solving matroid base problems
• Computing fair and bottleneck matchings in geometric graphs
• Minimum deviation and balanced optimization: A unified approach
• Assignment problems: a golden anniversary survey
• k-sum optimization problems

This page was built for publication: Minimum deviation problems

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