Multicriteria path and tree problems: discussion on exact algorithms and applications

DOI10.1111/j.1475-3995.2011.00815.xzbMath1267.90022OpenAlexW2062294368MaRDI QIDQ4918252

Marta M. B. Pascoal, Joao Carlos Namorado Climaco

Publication date: 24 April 2013

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2011.00815.x

zbMATH Keywords

multiobjective spanning tree problemsmultiobjective path problems

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10)

Related Items (19)

An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs ⋮ An exact method for the biobjective shortest path problem for large-scale road networks ⋮ An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks ⋮ Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation ⋮ Path based algorithms for metro network design ⋮ A new approach for the multiobjective minimum spanning tree ⋮ Dimensionality reduction in multiobjective shortest path search ⋮ Bicriteria path problem minimizing the cost and minimizing the number of labels ⋮ An improved multiobjective shortest path algorithm ⋮ On a relaxed maximally disjoint path pair problem: a bicriteria approach ⋮ Computational comparisons of different formulations for the Stackelberg minimum spanning tree game ⋮ Finding shortest and dissimilar paths ⋮ The Steiner bi-objective shortest path problem ⋮ An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks ⋮ Using MCDA to evaluate the performance of the logistics process in public hospitals: the case of a Brazilian teaching hospital ⋮ Speeding up Martins' algorithm for multiple objective shortest path problems ⋮ Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem ⋮ Path planning and vehicle scheduling optimization for logistic distribution of hazardous materials in full container load ⋮ Empirical study of exact algorithms for the multi-objective spanning tree

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• A preference-based approach to spanning trees and shortest paths problems
• Minimum cost path problems with relays
• An algorithm for ranking paths that may contain cycles
• On a multicriteria shortest path problem
• On a special class of bicriterion path problems
• Shortest paths in networks with vector weights
• A parametric approach to solving bicriterion shortest path problems
• Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function
• The quickest path problem
• An interactive approach to identify the best compromise solution for two objective shortest path problems
• Optimal paths in bi-attribute networks with fractional cost functions
• A comparison of solution strategies for biobjective shortest path problems
• Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
• On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
• Finding non-dominated bicriteria shortest pairs of disjoint simple paths
• A mixed integer linear formulation for the minimum label spanning tree problem
• The tricriterion shortest path problem with at least two bottleneck objective functions
• Labeling algorithms for multiple objective integer knapsack problems
• The maximum covering/shortest path problem: A multiobjective network design and routing formulation
• The shortest path problem with two objective functions
• Minimum cost-reliability ratio path problem
• A bicriterion shortest path algorithm
• Algorithms for the quickest path problem and the enumeration of quickest paths
• A multicriteria Pareto-optimal path algorithm
• Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function
• An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions
• An interactive procedure using domination cones for bicriterion shortest path problems
• On spanning tree problems with multiple objectives
• On bicriterion minimal spanning trees: An approximation
• An algorithm for the quickest path problem
• Paths with minimum range and ratio of arc lengths
• On the sum-max bicriterion path problem.
• The interactive analysis of the multicriteria shortest path problem by the reference point method.
• Multiple criteria optimization: State of the art annotated bibliographic surveys
• Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
• A new implementation of Yen's ranking loopless paths algorithm
• The minimum labeling spanning trees
• Numerical analysis of tricriteria tree and assignment problems
• Optimal paths in probabilistic networks
• The problem of the optimal biobjective spanning tree
• An empirical investigation of some bicriterion shortest path algorithms
• A survey and annotated bibliography of multiobjective combinatorial optimization
• A label-setting algorithm for finding a quickest path
• Shortest path problems with partial information: Models and algorithms for detecting dominance
• A label correcting approach for solving bicriterion shortest-path problems
• Multiobjective transportation network design and routing problems: Taxonomy and annotation
• A comprehensive survey on the quickest path problem
• Computing all efficient solutions of the biobjective minimum spanning tree problem
• Algorithms for time-dependent bicriteria shortest path problems
• New algorithms for multi objective shortest path problem.
• On the bicriterion - minimal cost/minimal label - spanning tree problem
• Stochastic Shortest Path Problems with Piecewise-Linear Concave Utility Functions
• The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
• Optimal paths in graphs with stochastic or multidimensional weights
• The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets
• On a routing problem
• The Constrained Bottleneck Problem in Networks
• A Class of Label-Correcting Methods for the K Shortest Paths Problem
• A Survey on Multiple Objective Minimum Spanning Tree Problems
• Finding the set of alternatives in discrete multicriterion problems
• A dual algorithm for the constrained shortest path problem
• An Algorithm for Finding K Minimum Spanning Trees
• An efficient algorithm for K shortest simple paths
• Two Algorithms for Generating Weighted Spanning Trees in Order
• Finding the k Shortest Paths
• An efficient implementation of an algorithm for findingK shortest simple paths
• Efficient Interactive Methods for a Class of Multiattribute Shortest Path Problems
• The determination of the path with minimum-cost norm value
• A bicriterion approach for routing problems in multimedia networks
• An interactive algorithm for deciding multi‐criteria weights in incomplete information environment
• DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
• Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
• Near-shortest and K-shortest simple paths
• An algorithm for finding shortest routes from all source nodes to a given destination in general networks
• Finding the K Shortest Loopless Paths in a Network
• An algorithm to determine a path with minimal cost/capacity ratio
• Label correcting methods to solve multicriteria shortest path problems

This page was built for publication: Multicriteria path and tree problems: discussion on exact algorithms and applications