Ordered weighted average optimization in multiobjective spanning tree problem

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

Cites work

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

Cited in

(13)

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

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)