Minimum dispersion problems
From MaRDI portal
Publication:1363766
Recommendations
Cites work
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
- A problem in vision that is polynomially solvable
- An Algorithm for Minimizing the Range of Lateness on a Single Machine
- An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion
- Balanced optimization problems
- Efficient algorithms for minimum range cut problems
- Linear and combinatorial sharing problems
- Minimax linear programming problem
- Minimization of maximum absolute deviation in integers
- Minimizing the Range of Lateness on a Single Machine
- Minimum deviation and balanced optimization: A unified approach
- Minimum deviation problems
- Most and least uniform spanning trees
- On \(k\)-sum optimization
- On finding most uniform spanning trees
- The Sharing Problem
- The ellipsoid method and its consequences in combinatorial optimization
Cited in
(5)
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)