Minimum dispersion problems

DOI10.1016/S0166-218X(96)00082-0zbMATH Open0883.90103OpenAlexW1995001486MaRDI QIDQ1363766FDOQ1363766

Authors: Abraham P. Punnen, Y. P. Aneja 

Publication date: 4 March 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

Recommendations

• Minimum deviation problems
• Heuristic and Special Case Algorithms for Dispersion Problems
• Approximation algorithms for dispersion problems
• scientific article; zbMATH DE number 177561

zbMATH Keywords

matching\(\varepsilon\)-approximation schemedispersion criterion

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• The ellipsoid method and its consequences in combinatorial optimization
• A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
• Efficient algorithms for minimum range cut problems
• Title not available (Why is that?)
• On finding most uniform spanning trees
• Minimum deviation problems
• Balanced optimization problems
• The Sharing Problem
• On \(k\)-sum optimization
• Minimum deviation and balanced optimization: A unified approach
• Minimax linear programming problem
• Linear and combinatorial sharing problems
• Most and least uniform spanning trees
• Minimization of maximum absolute deviation in integers
• An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion
• An Algorithm for Minimizing the Range of Lateness on a Single Machine
• Minimizing the Range of Lateness on a Single Machine
• A problem in vision that is polynomially solvable

Cited In (5)

• The range co-minima problem
• Ordered weighted average optimization in multiobjective spanning tree problem
• On discrete optimization with ordering
• The quadratic balanced optimization problem
• Minimum deviation problems

This page was built for publication: Minimum dispersion problems

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