Ordered weighted average optimization in multiobjective spanning tree problem
type: Item
instance of: scholarly article
title: Ordered weighted average optimization in multiobjective spanning tree problem
zbMATH Open document ID: 1403.90637
author: Elena Fernández
author: Miguel A. Pozo
author: Justo Puerto
author: Andrea Scozzari
published in: European Journal of Operational Research
publication date: 2018-05-29T00:00:00Z
full work available at URL: http://hdl.handle.net/2117/113316
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6875820
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: multiobjective optimization
zbMATH Keywords: ordered median
zbMATH Keywords: ordered weighted average
zbMATH Keywords: spanning trees
MaRDI profile type: Publication
OpenAlex ID: W2534675508
Wikidata QID: Q58217124
cites work: On bicriterion minimal spanning trees: An approximation
cites work: On the complexity of a class of combinatorial optimization problems with uncertainty
cites work: Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree
cites work: On the Set-Covering Problem
cites work: Exact procedures for solving the discrete ordered median problem
cites work: Simplification of the Covering Problem with Application to Boolean Expressions
cites work: Lexicographic optimisation in generalised network flow problems
cites work: Note—A Computational Survey of Methods for the Set Covering Problem
cites work: An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
cites work: An improved general procedure for lexicographic bottleneck problems
cites work: Q5684698
cites work: Matroids and the greedy algorithm
cites work: Multicriteria Optimization
cites work: A comparison of formulations and solution methods for the minimum-envy location problem
cites work: Ordered weighted average combinatorial optimization: formulations and their properties
cites work: Choquet-based optimisation in multiobjective shortest path and spanning tree problems
cites work: Exact algorithms for OWA-optimization in multiobjective spanning tree problems
cites work: On finding most uniform spanning trees
cites work: Q4198056
cites work: The \(k\)-centrum shortest path problem
cites work: Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
cites work: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
cites work: Ordered median functions and symmetries
cites work: Minimizing the Flow-time Variance in Single-machine Systems
cites work: Minimum deviation problems
cites work: Very Simple Methods for All Pairs Network Flow Analysis
cites work: On spanning tree problems with multiple objectives
cites work: Q3888874
cites work: Algorithms for Voting and Competitive Location on a Network
cites work: From the median to the generalized center
cites work: Optimum Communication Spanning Trees
cites work: Multifacility ordered median problems on networks: A further analysis
cites work: Algorithmic results for ordered median problems
cites work: Reducibility among Combinatorial Problems
cites work: Combinatorial optimization problems with uncertain costs and the OWA criterion
cites work: Covering Problems
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: Looking for edge-equitable spanning trees
cites work: The traveling salesman problem: An overview of exact and approximate algorithms
cites work: Covering Problems: Duality Relations and a New Method of Solution
cites work: A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
cites work: Q4845371
cites work: A flexible model and efficient solution strategies for discrete location problems
cites work: Balanced optimization problems
cites work: Using separation algorithms to generate mixed integer model reformulations
cites work: Improved algorithms for several network location problems with equality measures.
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Networks synthesis and optimum network design problems: Models, solution methods and applications
cites work: A generalized model of equality measures in network location problems
cites work: On solving linear programs with the ordered weighted averaging objective.
cites work: Minimizing the sum of the \(k\) largest functions in linear time.
cites work: A note on a new variant of Murty's ranking assignments algorithm
cites work: A New Formulation of the Capacitated Discrete Ordered Median Problems with {0, 1}-Assignment
cites work: Robust Positioning of Service Units
cites work: Locating tree-shaped facilities using the ordered median objective
cites work: Traveling salesman problem under categorization
cites work: Generalized Bottleneck Problems∗

Ordered weighted average optimization in multiobjective spanning tree problem (cites work)
cites work: Minimum dispersion problems

Ordered weighted average optimization in multiobjective spanning tree problem (cites work)
cites work: The problem of the optimal biobjective spanning tree

Ordered weighted average optimization in multiobjective spanning tree problem (cites work)
cites work: Optimal location of a path or tree on a network with cycles

Ordered weighted average optimization in multiobjective spanning tree problem (cites work)
cites work: Minimum perfect bipartite matchings and spanning trees under categorization

Ordered weighted average optimization in multiobjective spanning tree problem (cites work)
cites work: Q3330973

Ordered weighted average optimization in multiobjective spanning tree problem (cites work)
cites work: Centers to centroids in graphs

Ordered weighted average optimization in multiobjective spanning tree problem (cites work)
cites work: Q3853639

Ordered weighted average optimization in multiobjective spanning tree problem (cites work)
cites work: A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem

Ordered weighted average optimization in multiobjective spanning tree problem (cites work)
cites work: Computing all efficient solutions of the biobjective minimum spanning tree problem

Ordered weighted average optimization in multiobjective spanning tree problem (cites work)
cites work: The \(k\)-centrum multi-facility location problem

Ordered weighted average optimization in multiobjective spanning tree problem (cites work)
cites work: The centdian subtree on tree networks

Ordered weighted average optimization in multiobjective spanning tree problem (cites work)
cites work: Finding the K Shortest Loopless Paths in a Network

Ordered weighted average optimization in multiobjective spanning tree problem (cites work)
cites work: Min-max optimization of several classical discrete optimization problems

Ordered weighted average optimization in multiobjective spanning tree problem (DOI)
DOI: 10.1016/J.EJOR.2016.10.016