Ordered weighted average combinatorial optimization: formulations and their properties
From MaRDI portal
Publication:2449062
DOI10.1016/j.dam.2014.01.001zbMath1296.90111OpenAlexW1992605846WikidataQ58217138 ScholiaQ58217138MaRDI QIDQ2449062
Justo Puerto, Elena Fernández, Miguel A. Pozo
Publication date: 6 May 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.01.001
Related Items (14)
Ordered median problem with demand distribution weights ⋮ Extensions to the Weber problem ⋮ Locating hyperplanes to fitting set of points: a general framework ⋮ Using \(\ell^p\)-norms for fairness in combinatorial optimisation ⋮ A comparative study of different formulations for the capacitated discrete ordered median problem ⋮ Revisiting \(k\)-sum optimization ⋮ Approximating combinatorial optimization problems with the ordered weighted averaging criterion ⋮ Using the WOWA operator in robust discrete optimization problems ⋮ On the generality of the greedy algorithm for solving matroid base problems ⋮ Ordered weighted average optimization in multiobjective spanning tree problem ⋮ ON THE AGGREGATION OF EXPERTS' INFORMATION IN BONUS–MALUS SYSTEMS ⋮ A minmax regret version of the time-dependent shortest path problem ⋮ A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem ⋮ A branch-and-price approach for the continuous multifacility monotone ordered median problem
Cites Work
- A flexible model and efficient solution strategies for discrete location problems
- Compact versus noncompact LP formulations for minimizing convex Choquet integrals
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems
- Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
- Locating tree-shaped facilities using the ordered median objective
- On solving linear programs with the ordered weighted averaging objective.
- Minimizing the sum of the \(k\) largest functions in linear time.
- Shortest paths algorithms: Theory and experimental evaluation
- Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
- Exact procedures for solving the discrete ordered median problem
- Location Theory
- Ordered median functions and symmetries
- Solving matching problems with linear programming
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- Integral Representation Without Additivity
- Multicriteria Optimization
- Paths, Trees, and Flowers
- Unnamed Item
This page was built for publication: Ordered weighted average combinatorial optimization: formulations and their properties
