Multicriteria path and tree problems: discussion on exact algorithms and applications (Q4918252): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 15:22, 30 December 2024

scientific article; zbMATH DE number 6156979

Language	Label	Description	Also known as
English	Multicriteria path and tree problems: discussion on exact algorithms and applications	scientific article; zbMATH DE number 6156979

Statements

scholarly article

0 references

Multicriteria path and tree problems: discussion on exact algorithms and applications (English)

0 references

Marta M. B. Pascoal

0 references

Joao Carlos Namorado Climaco

0 references

International Transactions in Operational Research

0 references

publication date

24 April 2013

0 references

zbMATH Keywords

multiobjective path problems

0 references

multiobjective spanning tree problems

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1111/j.1475-3995.2011.00815.x

0 references

Minimum cost-reliability ratio path problem

0 references

On bicriterion minimal spanning trees: An approximation

0 references

On a routing problem

0 references

The Constrained Bottleneck Problem in Networks

0 references

The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets

0 references

An empirical investigation of some bicriterion shortest path algorithms

0 references

Solving bicriteria 0--1 knapsack problems using a labeling algorithm.

0 references

A mixed integer linear formulation for the minimum label spanning tree problem

0 references

Near-shortest and K-shortest simple paths

0 references

The minimum labeling spanning trees

0 references

The quickest path problem

0 references

On the bicriterion - minimal cost/minimal label - spanning tree problem

0 references

A bicriterion approach for routing problems in multimedia networks

0 references

A bicriterion shortest path algorithm

0 references

Finding non-dominated bicriteria shortest pairs of disjoint simple paths

0 references

Shortest paths in networks with vector weights

0 references

An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions

0 references

Multiobjective transportation network design and routing problems: Taxonomy and annotation

0 references

The maximum covering/shortest path problem: A multiobjective network design and routing formulation

0 references

The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks

0 references

An interactive approach to identify the best compromise solution for two objective shortest path problems

0 references

Shortest path problems with partial information: Models and algorithms for detecting dominance

0 references

A note on two problems in connexion with graphs

0 references

A survey and annotated bibliography of multiobjective combinatorial optimization

0 references

Multiple criteria optimization: State of the art annotated bibliographic surveys

0 references

Finding the k Shortest Paths

0 references

Labeling algorithms for multiple objective integer knapsack problems

0 references

Two Algorithms for Generating Weighted Spanning Trees in Order

0 references

Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function

0 references

The interactive analysis of the multicriteria shortest path problem by the reference point method.

0 references

Label correcting methods to solve multicriteria shortest path problems

0 references

A Class of Label-Correcting Methods for the K Shortest Paths Problem

0 references

An interactive algorithm for deciding multi‐criteria weights in incomplete information environment

0 references

An efficient implementation of an algorithm for findingK shortest simple paths

0 references

On spanning tree problems with multiple objectives

0 references

Algorithms for time-dependent bicriteria shortest path problems

0 references

A dual algorithm for the constrained shortest path problem

0 references

Paths with minimum range and ratio of arc lengths

0 references

The shortest path problem with two objective functions

0 references

Efficient Interactive Methods for a Class of Multiattribute Shortest Path Problems

0 references

An Algorithm for Finding <i>K</i> Minimum Spanning Trees

0 references

An efficient algorithm for K shortest simple paths

0 references

Minimum cost path problems with relays

0 references

Optimal paths in graphs with stochastic or multidimensional weights

0 references

An algorithm for ranking paths that may contain cycles

0 references

An algorithm to determine a path with minimal cost/capacity ratio

0 references

On a multicriteria shortest path problem

0 references

On a special class of bicriterion path problems

0 references

A new implementation of Yen's ranking loopless paths algorithm

0 references

DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS

0 references

An algorithm for the quickest path problem

0 references

Numerical analysis of tricriteria tree and assignment problems

0 references

A parametric approach to solving bicriterion shortest path problems

0 references

An interactive procedure using domination cones for bicriterion shortest path problems

0 references

Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function

0 references

Stochastic Shortest Path Problems with Piecewise-Linear Concave Utility Functions

0 references

Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems

0 references

The determination of the path with minimum-cost norm value

0 references

A label-setting algorithm for finding a quickest path

0 references

A comprehensive survey on the quickest path problem

0 references

On the sum-max bicriterion path problem.

0 references

A preference-based approach to spanning trees and shortest paths problems

0 references

The tricriterion shortest path problem with at least two bottleneck objective functions

0 references

On algorithms for the tricriteria shortest path problem with two bottleneck objective functions

0 references

A comparison of solution strategies for biobjective shortest path problems

0 references

The problem of the optimal biobjective spanning tree

0 references

Optimal paths in probabilistic networks

0 references

Algorithms for the quickest path problem and the enumeration of quickest paths

0 references

A Survey on Multiple Objective Minimum Spanning Tree Problems

0 references

New algorithms for multi objective shortest path problem.

0 references

Finding the set of alternatives in discrete multicriterion problems

0 references

0 references

A label correcting approach for solving bicriterion shortest-path problems

0 references

Optimal paths in bi-attribute networks with fractional cost functions

0 references

Computing all efficient solutions of the biobjective minimum spanning tree problem

0 references

Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms

0 references

0 references

A multicriteria Pareto-optimal path algorithm

0 references

An algorithm for finding shortest routes from all source nodes to a given destination in general networks

0 references

Finding the <i>K</i> Shortest Loopless Paths in a Network

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1111/J.1475-3995.2011.00815.X

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4918252

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4918252&oldid=39493722"