Ordered weighted average combinatorial optimization: formulations and their properties
From MaRDI portal
(Redirected from Publication:2449062)
Recommendations
- On Solving Optimization Problems with Ordered Average Criteria and Constraints
- Alternative formulations for the ordered weighted averaging objective
- Ordered weighted average optimization in multiobjective spanning tree problem
- On solving linear programs with the ordered weighted averaging objective.
- Approximating combinatorial optimization problems with the ordered weighted averaging criterion
Cites work
- scientific article; zbMATH DE number 1042200 (Why is no real title available?)
- A flexible model and efficient solution strategies for discrete location problems
- Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
- Compact versus noncompact LP formulations for minimizing convex Choquet integrals
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems
- Exact procedures for solving the discrete ordered median problem
- Integral Representation Without Additivity
- Locating tree-shaped facilities using the ordered median objective
- Location theory. A unified approach
- Minimizing the sum of the \(k\) largest functions in linear time.
- Multicriteria Optimization
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- On solving linear programs with the ordered weighted averaging objective.
- Ordered median functions and symmetries
- Paths, Trees, and Flowers
- Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
- Shortest paths algorithms: Theory and experimental evaluation
- Solving matching problems with linear programming
Cited in
(21)- Optimizing three-dimensional constrained ordered weighted averaging aggregation problem with bounded variables
- Locating hyperplanes to fitting set of points: a general framework
- A fresh view on the discrete ordered median problem based on partial monotonicity
- On Solving Optimization Problems with Ordered Average Criteria and Constraints
- On the generality of the greedy algorithm for solving matroid base problems
- Using \(\ell^p\)-norms for fairness in combinatorial optimisation
- The biobjective minimum-cost perfect matching problem and Chinese postman problem
- A comparative study of different formulations for the capacitated discrete ordered median problem
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- On solving linear programs with the ordered weighted averaging objective.
- Approximating combinatorial optimization problems with the ordered weighted averaging criterion
- Using the WOWA operator in robust discrete optimization problems
- Revisiting \(k\)-sum optimization
- A minmax regret version of the time-dependent shortest path problem
- A three-dimensional constrained ordered weighted averaging aggregation problem with lower bounded variables
- On the aggregation of experts' information in bonus-malus systems
- Ordered median problem with demand distribution weights
- Alternative formulations for the ordered weighted averaging objective
- Extensions to the Weber problem
- A branch-and-price approach for the continuous multifacility monotone ordered median problem
- Ordered weighted average optimization in multiobjective spanning tree problem
This page was built for publication: Ordered weighted average combinatorial optimization: formulations and their properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2449062)
