Balanced optimization problems
From MaRDI portal
Publication:760338
DOI10.1016/0167-6377(84)90061-0zbMath0554.90078OpenAlexW2008284829MaRDI QIDQ760338
Silvano Martello, William R. Pulleyblank, Dominique de Werra, Paolo Toth
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
computational complexitycombinatorial optimizationpolynomial algorithmmatching problemassignment problembalanced optimizationfeasible subset
Related Items
Most and least uniform spanning trees, Assignment problems: a golden anniversary survey, Minimum deviation problems, Minimum dispersion problems, On discrete optimization with ordering, A strongly polynomial algorithm for the uniform balanced network flow problem, Revisiting \(k\)-sum optimization, On weighting two criteria with a parameter in combinatorial optimization problems, The balanced traveling salesman problem, A weighted perfect matching with constraints on weights of its parts, A branch-and-cut algorithm for the balanced traveling salesman problem, On generalized balanced optimization problems, Nash balanced assignment problem, Generalized nash fairness solutions for bi‐objective minimization problems, Balanced Optimization with Vector Costs, k-sum optimization problems, Constrained balanced optimization problems, An inverse model for the most uniform problem, Graphical-structure-based models for routing problems, Lexicographic balanced optimization problems, The image of weighted combinatorial problems, Quadratic bottleneck problems, An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion, Robust balanced optimization, Constrained partitioning problems, On the generality of the greedy algorithm for solving matroid base problems, The linear balancing flow problem, Ordered weighted average optimization in multiobjective spanning tree problem, Exact algorithms for the equitable traveling salesman problem, Selected topics on assignment problems, Balanced paths in acyclic networks: Tractable cases and related approaches, On a pair of job-machine assignment problems with two stages, Approximation algorithms for the load-balanced capacitated vehicle routing problem, Most uniform path partitioning and its use in image processing, Unnamed Item, What is my objective function?, The balanced linear programming problem, On uniform \(k\)-partition problems, Classical and new heuristics for the open-shop problem: A computational evaluation, The quadratic balanced optimization problem, Minimum deviation and balanced optimization: A unified approach, Computing Euclidean bottleneck matchings in higher dimensions, Competitive strategies for an online generalized assignment problem with a service consecution constraint
Cites Work
