Ordered weighted average optimization in multiobjective spanning tree problem
From MaRDI portal
Publication:1753508
DOI10.1016/j.ejor.2016.10.016zbMath1403.90637OpenAlexW2534675508WikidataQ58217124 ScholiaQ58217124MaRDI QIDQ1753508
Elena Fernández, Miguel A. Pozo, Justo Puerto, Andrea Scozzari
Publication date: 29 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/113316
combinatorial optimizationmultiobjective optimizationspanning treesordered medianordered weighted average
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)
Related Items
Optimizing three-dimensional constrained ordered weighted averaging aggregation problem with bounded variables, Locating hyperplanes to fitting set of points: a general framework, A comparative study of different formulations for the capacitated discrete ordered median problem, Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods, Two‐phase strategies for the bi‐objective minimum spanning tree problem, Computational comparisons of different formulations for the Stackelberg minimum spanning tree game, Approximating combinatorial optimization problems with the ordered weighted averaging criterion, Constraint relaxation for the discrete ordered median problem, A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem, The ordered \(k\)-median problem: surrogate models and approximation algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Looking for edge-equitable spanning trees
- Combinatorial optimization problems with uncertain costs and the OWA criterion
- Balanced optimization problems
- The \(k\)-centrum shortest path problem
- A comparison of formulations and solution methods for the minimum-envy location problem
- A flexible model and efficient solution strategies for discrete location problems
- On finding most uniform spanning trees
- Minimum deviation problems
- Using separation algorithms to generate mixed integer model reformulations
- The traveling salesman problem: An overview of exact and approximate algorithms
- Traveling salesman problem under categorization
- Minimum perfect bipartite matchings and spanning trees under categorization
- Min-max optimization of several classical discrete optimization problems
- An improved general procedure for lexicographic bottleneck problems
- On spanning tree problems with multiple objectives
- On bicriterion minimal spanning trees: An approximation
- Minimum dispersion problems
- Improved algorithms for several network location problems with equality measures.
- A note on a new variant of Murty's ranking assignments algorithm
- The centdian subtree on tree networks
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems
- Locating tree-shaped facilities using the ordered median objective
- The problem of the optimal biobjective spanning tree
- On solving linear programs with the ordered weighted averaging objective.
- Minimizing the sum of the \(k\) largest functions in linear time.
- Algorithmic results for ordered median problems
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
- Computing all efficient solutions of the biobjective minimum spanning tree problem
- Ordered weighted average combinatorial optimization: formulations and their properties
- A generalized model of equality measures in network location problems
- Exact procedures for solving the discrete ordered median problem
- Choquet-based optimisation in multiobjective shortest path and spanning tree problems
- A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
- Ordered median functions and symmetries
- Lexicographic optimisation in generalised network flow problems
- Optimal location of a path or tree on a network with cycles
- Optimum Communication Spanning Trees
- Integer Programming Formulation of Traveling Salesman Problems
- Very Simple Methods for All Pairs Network Flow Analysis
- Algorithms for Voting and Competitive Location on a Network
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Centers to centroids in graphs
- From the median to the generalized center
- Note—A Computational Survey of Methods for the Set Covering Problem
- Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
- Multifacility ordered median problems on networks: A further analysis
- Robust Positioning of Service Units
- Generalized Bottleneck Problems∗
- Reducibility among Combinatorial Problems
- Minimizing the Flow-time Variance in Single-machine Systems
- Multicriteria Optimization
- A New Formulation of the Capacitated Discrete Ordered Median Problems with {0, 1}-Assignment
- Covering Problems: Duality Relations and a New Method of Solution
- Simplification of the Covering Problem with Application to Boolean Expressions
- Finding the K Shortest Loopless Paths in a Network
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- On the Set-Covering Problem
- Matroids and the greedy algorithm
- Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree
- Covering Problems
- The \(k\)-centrum multi-facility location problem
- On the complexity of a class of combinatorial optimization problems with uncertainty
