Ordered weighted average optimization in multiobjective spanning tree problem

DOI10.1016/J.EJOR.2016.10.016zbMATH Open1403.90637OpenAlexW2534675508WikidataQ58217124 ScholiaQ58217124MaRDI QIDQ1753508FDOQ1753508

Authors: 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

Recommendations

• Exact algorithms for OWA-optimization in multiobjective spanning tree problems
• Ordered weighted average combinatorial optimization: formulations and their properties
• Combining linear and nonlinear objectives in spanning tree problems
• On spanning tree problems with multiple objectives
• Publication:4733693

zbMATH Keywords

spanning treescombinatorial optimizationmultiobjective optimizationordered medianordered weighted average

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Title not available (Why is that?)
• Reducibility among Combinatorial Problems
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• Integer Programming Formulation of Traveling Salesman Problems
• Title not available (Why is that?)
• Multicriteria Optimization
• The traveling salesman problem: An overview of exact and approximate algorithms
• Note—A Computational Survey of Methods for the Set Covering Problem
• Title not available (Why is that?)
• Exact algorithms for OWA-optimization in multiobjective spanning tree problems
• On solving linear programs with the ordered weighted averaging objective.
• Finding the K Shortest Loopless Paths in a Network
• On the complexity of a class of combinatorial optimization problems with uncertainty
• On the Set-Covering Problem
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
• A generalized model of equality measures in network location problems
• A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Using separation algorithms to generate mixed integer model reformulations
• An improved general procedure for lexicographic bottleneck problems
• Matroids and the greedy algorithm
• A comparison of formulations and solution methods for the minimum-envy location problem
• Min-max optimization of several classical discrete optimization problems
• On spanning tree problems with multiple objectives
• Algorithmic results for ordered median problems
• Looking for edge-equitable spanning trees
• The \(k\)-centrum multi-facility location problem
• A flexible model and efficient solution strategies for discrete location problems
• Exact procedures for solving the discrete ordered median problem
• Optimum Communication Spanning Trees
• Algorithms for Voting and Competitive Location on a Network
• Multifacility ordered median problems on networks: A further analysis
• Minimizing the sum of the \(k\) largest functions in linear time.
• Choquet-based optimisation in multiobjective shortest path and spanning tree problems
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• Combinatorial optimization problems with uncertain costs and the OWA criterion
• A note on a new variant of Murty's ranking assignments algorithm
• Very Simple Methods for All Pairs Network Flow Analysis
• Ordered median functions and symmetries
• On finding most uniform spanning trees
• Minimum deviation problems
• Traveling salesman problem under categorization
• Minimum dispersion problems
• Improved algorithms for several network location problems with equality measures.
• The centdian subtree on tree networks
• Locating tree-shaped facilities using the ordered median objective
• An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
• Lexicographic optimisation in generalised network flow problems
• Title not available (Why is that?)
• Centers to centroids in graphs
• From the median to the generalized center
• Robust Positioning of Service Units
• Generalized Bottleneck Problems^∗
• Minimizing the Flow-time Variance in Single-machine Systems
• 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
• Covering Problems
• Balanced optimization problems
• The \(k\)-centrum shortest path problem
• The problem of the optimal biobjective spanning tree
• Computing all efficient solutions of the biobjective minimum spanning tree problem
• Minimum perfect bipartite matchings and spanning trees under categorization
• On bicriterion minimal spanning trees: An approximation
• Ordered weighted average combinatorial optimization: formulations and their properties
• Optimal location of a path or tree on a network with cycles
• Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree

Cited In (11)

• Constraint relaxation for the discrete ordered median problem
• The ordered \(k\)-median problem: surrogate models and approximation algorithms
• Optimizing three-dimensional constrained ordered weighted averaging aggregation problem with bounded variables
• Locating hyperplanes to fitting set of points: a general framework
• Approximating combinatorial optimization problems with the ordered weighted averaging criterion
• Computational comparisons of different formulations for the Stackelberg minimum spanning tree game
• Exact algorithms for OWA-optimization in multiobjective spanning tree problems
• Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
• 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
• Two‐phase strategies for the bi‐objective minimum spanning tree problem

This page was built for publication: Ordered weighted average optimization in multiobjective spanning tree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753508)