Balanced optimization problems
From MaRDI portal
Publication:760338
DOI10.1016/0167-6377(84)90061-0zbMATH Open0554.90078OpenAlexW2008284829MaRDI QIDQ760338FDOQ760338
Paolo Toth, Silvano Martello, William R. Pulleyblank, Dominique De Werra
Publication date: 1984
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(84)90061-0
Recommendations
- Constrained balanced optimization problems
- On generalized balanced optimization problems
- Balanced Optimization with Vector Costs
- The balanced linear programming problem
- scientific article
- Robust balanced optimization
- The quadratic balanced optimization problem
- scientific article; zbMATH DE number 917802
- Lexicographic balanced optimization problems
- A class of balanced allocation problems
computational complexitycombinatorial optimizationassignment problempolynomial algorithmmatching problembalanced optimizationfeasible subset
Cites Work
Cited In (49)
- Minimum dispersion problems
- The linear balancing flow problem
- Lexicographic balanced optimization problems
- Nash balanced assignment problem
- Balanced Optimization with Vector Costs
- Exact algorithms for the equitable traveling salesman problem
- Assignment problems: a golden anniversary survey
- Selected topics on assignment problems
- Quadratic bottleneck problems
- On uniform \(k\)-partition problems
- What is my objective function?
- Balanced paths in acyclic networks: Tractable cases and related approaches
- Ordered weighted average optimization in multiobjective spanning tree problem
- On a pair of job-machine assignment problems with two stages
- Most uniform path partitioning and its use in image processing
- Title not available (Why is that?)
- The balanced traveling salesman problem
- Balanced states in vector optimization problems
- Approximation algorithms for the load-balanced capacitated vehicle routing problem
- Graphical-structure-based models for routing problems
- Most and least uniform spanning trees
- An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion
- The image of weighted combinatorial problems
- The balanced linear programming problem
- A weighted perfect matching with constraints on weights of its parts
- A strongly polynomial algorithm for the uniform balanced network flow problem
- On weighting two criteria with a parameter in combinatorial optimization problems
- A class of balanced allocation problems
- Minimum deviation and balanced optimization: A unified approach
- On the generality of the greedy algorithm for solving matroid base problems
- Computing Euclidean bottleneck matchings in higher dimensions
- Constrained balanced optimization problems
- An inverse model for the most uniform problem
- On discrete optimization with ordering
- Finding optimal line balances with OptPack
- On some stochastic balanced optimization problems
- k-sum optimization problems
- Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
- On generalized balanced optimization problems
- Revisiting \(k\)-sum optimization
- Constrained partitioning problems
- Classical and new heuristics for the open-shop problem: A computational evaluation
- Robust balanced optimization
- Title not available (Why is that?)
- Competitive strategies for an online generalized assignment problem with a service consecution constraint
- The quadratic balanced optimization problem
- Minimum deviation problems
- Generalized nash fairness solutions for bi‐objective minimization problems
- A branch-and-cut algorithm for the balanced traveling salesman 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)
