Balanced optimization problems
From MaRDI portal
So-called balanced optimization problems are combinatorial problems in which a feasible subset of a finite set must be found, such that the difference between the maximal and the minimal elements is as small as possible. The algorithms for these problems, given in the paper, are polynomial if there are polynomial procedures for finding the feasible subsets.
Recommendations
- Constrained balanced optimization problems
- On generalized balanced optimization problems
- Balanced Optimization with Vector Costs
- The balanced linear programming problem
- scientific article; zbMATH DE number 7033214
- Robust balanced optimization
- The quadratic balanced optimization problem
- scientific article; zbMATH DE number 917802
- Lexicographic balanced optimization problems
- A class of balanced allocation problems
Cites work
Cited in
(53)- Most and least uniform spanning trees
- Minimum deviation problems
- A class of balanced allocation problems
- Finding optimal line balances with OptPack
- The image of weighted combinatorial problems
- An -approximation scheme for combinatorial optimization problems with minimum variance criterion
- What is my objective function?
- The balanced linear programming problem
- Classical and new heuristics for the open-shop problem: A computational evaluation
- Minimum dispersion problems
- A strongly polynomial algorithm for the uniform balanced network flow problem
- Lexicographic balanced optimization problems
- Computing Euclidean bottleneck matchings in higher dimensions
- Revisiting k-sum optimization
- Ordered weighted average optimization in multiobjective spanning tree problem
- Exact algorithms for the equitable traveling salesman problem
- Most uniform path partitioning and its use in image processing
- On weighting two criteria with a parameter in combinatorial optimization problems
- Constrained balanced optimization problems
- Approximation algorithms for the load-balanced capacitated vehicle routing problem
- Measures of balance in combinatorial optimization
- Balanced states in vector optimization problems
- The quadratic balanced optimization problem
- Competitive strategies for an online generalized assignment problem with a service consecution constraint
- On uniform \(k\)-partition problems
- Optimizing properties of balanced words
- Balanced Optimization with Vector Costs
- scientific article; zbMATH DE number 7033214 (Why is no real title available?)
- Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
- On some stochastic balanced optimization problems
- On discrete optimization with ordering
- Graphical-structure-based models for routing problems
- Balanced paths in acyclic networks: Tractable cases and related approaches
- On the generality of the greedy algorithm for solving matroid base problems
- A weighted perfect matching with constraints on weights of its parts
- scientific article; zbMATH DE number 7238975 (Why is no real title available?)
- Quadratic bottleneck problems
- Constrained partitioning problems
- On The Relations Between Optimal Solutions For Different Types OfMin-SumBalanced Jit Optimisation Problems
- A branch-and-cut algorithm for the balanced traveling salesman problem
- The balanced traveling salesman problem
- Nash balanced assignment problem
- Generalized nash fairness solutions for bi‐objective minimization problems
- On generalized balanced optimization problems
- Robust balanced optimization
- The linear balancing flow problem
- Selected topics on assignment problems
- Generalized Nash fairness solutions for bi-objective discrete optimization: theory and algorithms
- On a pair of job-machine assignment problems with two stages
- Minimum deviation and balanced optimization: A unified approach
- Assignment problems: a golden anniversary survey
- k-sum optimization problems
- An inverse model for the most uniform problem
This page was built for publication: Balanced optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q760338)
