Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
From MaRDI portal
Publication:1873011
DOI10.1016/S0377-2217(02)00353-3zbMath1026.90074OpenAlexW2113849611MaRDI QIDQ1873011
Anders J. V. Skriver, Matthias Ehrgott
Publication date: 19 May 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00353-3
Related Items (6)
Algorithm robust for the bicriteria discrete optimization problem ⋮ A decision-theoretic approach to robust optimization in multivalued graphs ⋮ Computing all efficient solutions of the biobjective minimum spanning tree problem ⋮ An efficient procedure for finding best compromise solutions to the multi-objective assignment problem ⋮ Min-ordering and max-ordering scalarization methods for multi-objective robust optimization ⋮ Exact algorithms for OWA-optimization in multiobjective spanning tree problems
Cites Work
- Unnamed Item
- Unnamed Item
- The matroidal knapsack: A class of (often) well-solvable problems
- Algorithms for finding k-best perfect matchings
- k-optimal solution sets for some polynomially solvable scheduling problems
- Bicriteria network flow problems: Integer case
- Geometric methods to solve max-ordering location problems
- Practical bilevel optimization. Algorithms and applications
- An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions
- Approximating the noninferior set in multiobjective linear programming problems
- An algorithm for the ranking of shortest paths
- On spanning tree problems with multiple objectives
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- Multicriteria optimization
- Note on combinatorial optimization with max-linear objective functions
- The problem of the optimal biobjective spanning tree
- A survey and annotated bibliography of multiobjective combinatorial optimization
- A note on \(K\) best network flows
- On matroids with multiple objectives
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- A Model and Solution Algorithm for Optimal Routing of a Time-Chartered Containership
- Intersection of Two Matroids: (Condensed) Border Graphs and Ranking
- An Algorithm for Finding K Minimum Spanning Trees
- Solving min-max shortest-path problems on a network
- Two Algorithms for Generating Weighted Spanning Trees in Order
- Finding the k Shortest Paths
- A naïve approach for solving MCDM problems: the GUESS method
- An interactive weighted Tchebycheff procedure for multiple objective programming
- DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- Linear programming with multiple objective functions: Step method (stem)
This page was built for publication: Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
