Lexicographic balanced optimization problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- An Algorithm for Minimizing the Range of Lateness on a Single Machine
- An O(m n) algorithm for the max+sum spanning tree problem
- An improved general procedure for lexicographic bottleneck problems
- Balanced optimization problems
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- Lexicographic bottleneck combinatorial problems
- Lexicographical problems of linear programming
- Minimization of maximum absolute deviation in integers
- Minimizing the Range of Lateness on a Single Machine
- Minimum Range Balanced Cuts via Dynamic Subset Sums
- On finding most uniform spanning trees
- The Min-Max Spanning Tree Problem and some extensions
- The balanced linear programming problem
Cited in
(13)- Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions
- A lexicographic optimization algorithm
- Generalized multiple objective bottleneck problems
- The balanced traveling salesman problem
- A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks
- On k-Max-optimization
- Task preference-based bottleneck assignment problem
- On discrete optimization with ordering
- On some stochastic balanced optimization problems
- On generalized balanced optimization problems
- Balanced optimization problems
- scientific article; zbMATH DE number 125284 (Why is no real title available?)
- The quadratic balanced optimization problem
This page was built for publication: Lexicographic balanced optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1433654)