The following pages link to Balanced optimization problems (Q760338):
Displaying 49 items.
- On discrete optimization with ordering (Q367635) (← links)
- On the generality of the greedy algorithm for solving matroid base problems (Q496445) (← links)
- The balanced traveling salesman problem (Q614063) (← links)
- On generalized balanced optimization problems (Q627450) (← links)
- Robust balanced optimization (Q668952) (← links)
- The linear balancing flow problem (Q684332) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- On a pair of job-machine assignment problems with two stages (Q732901) (← links)
- Minimum deviation and balanced optimization: A unified approach (Q806674) (← links)
- Assignment problems: a golden anniversary survey (Q852938) (← links)
- k-sum optimization problems (Q916568) (← links)
- An inverse model for the most uniform problem (Q924880) (← links)
- Most and least uniform spanning trees (Q1087546) (← links)
- Minimum deviation problems (Q1104246) (← links)
- A class of balanced allocation problems (Q1107433) (← links)
- Finding optimal line balances with OptPack (Q1178719) (← links)
- The image of weighted combinatorial problems (Q1179736) (← links)
- An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion (Q1183333) (← links)
- What is my objective function? (Q1278819) (← links)
- The balanced linear programming problem (Q1278929) (← links)
- Classical and new heuristics for the open-shop problem: A computational evaluation (Q1296088) (← links)
- Minimum dispersion problems (Q1363766) (← links)
- A strongly polynomial algorithm for the uniform balanced network flow problem (Q1382257) (← links)
- Lexicographic balanced optimization problems (Q1433654) (← links)
- Computing Euclidean bottleneck matchings in higher dimensions (Q1607062) (← links)
- Revisiting \(k\)-sum optimization (Q1675256) (← links)
- Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
- Exact algorithms for the equitable traveling salesman problem (Q1753595) (← links)
- Most uniform path partitioning and its use in image processing (Q1803677) (← links)
- On weighting two criteria with a parameter in combinatorial optimization problems (Q1926813) (← links)
- Constrained balanced optimization problems (Q1963024) (← links)
- Approximation algorithms for the load-balanced capacitated vehicle routing problem (Q2043586) (← links)
- Measures of balance in combinatorial optimization (Q2168777) (← links)
- Balanced states in vector optimization problems (Q2266671) (← links)
- The quadratic balanced optimization problem (Q2339810) (← links)
- Competitive strategies for an online generalized assignment problem with a service consecution constraint (Q2355803) (← links)
- On uniform \(k\)-partition problems (Q2565854) (← links)
- Optimizing properties of balanced words (Q2789534) (← links)
- Balanced Optimization with Vector Costs (Q2971159) (← links)
- (Q3119209) (← links)
- Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization (Q3133922) (← links)
- Graphical-structure-based models for routing problems (Q3799805) (← links)
- Balanced paths in acyclic networks: Tractable cases and related approaches (Q4667719) (← links)
- A weighted perfect matching with constraints on weights of its parts (Q5100129) (← links)
- (Q5116484) (← links)
- Quadratic bottleneck problems (Q5392805) (← links)
- Constrained partitioning problems (Q5896609) (← links)
- A branch-and-cut algorithm for the balanced traveling salesman problem (Q6123381) (← links)
- Generalized nash fairness solutions for bi‐objective minimization problems (Q6180043) (← links)
