scientific article
From MaRDI portal
Publication:3888874
zbMath0444.90098MaRDI QIDQ3888874
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitypolynomial algorithmsdirected graphsfully polynomial approximation schemebicriterion path problemsmaxmin-maxmin problemminsum-maxmin problemminsum-minsum problempseudo-polynomial exact algorithm
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Directed graphs (digraphs), tournaments (05C20)
Related Items (only showing first 100 items - show all)
The shortest path problem with two objective functions ⋮ Variable and large neighborhood search to solve the multiobjective set covering problem ⋮ The median tour and maximal covering tour problems: Formulations and heuristics ⋮ A bi-objective approach to discrete cost-bottleneck location problems ⋮ Multiobjective routing of hazardous materials in stochastic networks ⋮ Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network ⋮ Decision-making based on approximate and smoothed Pareto curves ⋮ Multiobjective shortest path problems with lexicographic goal-based preferences ⋮ On multi-objective optimization aided drawing of special graphs ⋮ An exact method for the biobjective shortest path problem for large-scale road networks ⋮ A comprehensive survey on the quickest path problem ⋮ A decision-theoretic approach to robust optimization in multivalued graphs ⋮ Multicriteria stochastic shortest path problem for electric vehicles ⋮ Uncertain programming models for multi-objective shortest path problem with uncertain parameters ⋮ Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits ⋮ Pricing routines for vehicle routing with time windows on road networks ⋮ Analysis of FPTASes for the multi-objective shortest path problem ⋮ A population-based algorithm for solving linear assignment problems with two objectives ⋮ An algorithm for the quickest path problem ⋮ Fuzzy shortest path problem with finite fuzzy quantities ⋮ Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem ⋮ On computing Pareto optimal paths in weighted time-dependent networks ⋮ PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries ⋮ Paths with minimum range and ratio of arc lengths ⋮ Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points ⋮ Shortest paths with shortest detours. A biobjective routing problem ⋮ A general decomposition approach for multi-criteria decision trees ⋮ Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs ⋮ An aggregate label setting policy for the multi-objective shortest path problem ⋮ On a biobjective search problem in a line: formulations and algorithms ⋮ Approximation with a fixed number of solutions of some multiobjective maximization problems ⋮ On the sum-max bicriterion path problem. ⋮ The interactive analysis of the multicriteria shortest path problem by the reference point method. ⋮ Computation of ideal and Nadir values and implications for their use in MCDM methods. ⋮ Lower bound sets for biobjective shortest path problems ⋮ A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives ⋮ Dynamic programming and minimum risk paths ⋮ Generalized dynamic programming for multicriteria optimization ⋮ Solving bicriteria 0--1 knapsack problems using a labeling algorithm. ⋮ A comparison of heuristic best-first algorithms for bicriterion shortest path problems ⋮ An interactive approach to identify the best compromise solution for two objective shortest path problems ⋮ Speeding up Martins' algorithm for multiple objective shortest path problems ⋮ Decision making with multiple objectives using GAI networks ⋮ Generalized multiple objective bottleneck problems ⋮ A bicriterion shortest path algorithm ⋮ On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. ⋮ Fuzzy shortest path problems incorporating interactivity among paths. ⋮ Optimal paths in bi-attribute networks with fractional cost functions ⋮ A biobjective Dijkstra algorithm ⋮ Two phase algorithms for the bi-objective assignment problem ⋮ An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing ⋮ Maximum probability shortest path problem ⋮ Algorithms for time-dependent bicriteria shortest path problems ⋮ Finding representative systems for discrete bicriterion optimization problems ⋮ A new algorithm to compute Pareto-optimal paths in a multi objective fuzzy weighted network ⋮ Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network ⋮ Covers and approximations in multiobjective optimization ⋮ A multicriteria Pareto-optimal path algorithm ⋮ Extended dominance and a stochastic shortest path problem ⋮ Dealing with residual energy when transmitting data in energy-constrained capacitated networks ⋮ Routing with nonlinear multiattribute cost functions ⋮ Discrete representation of the non-dominated set for multi-objective optimization problems using kernels ⋮ Reference points and approximation algorithms in multicriteria discrete optimization ⋮ Ordered weighted average optimization in multiobjective spanning tree problem ⋮ A comparison of solution strategies for biobjective shortest path problems ⋮ New algorithms for multi objective shortest path problem. ⋮ Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization ⋮ Exact algorithms for OWA-optimization in multiobjective spanning tree problems ⋮ Robust scheduling on a single machine to minimize total flow time ⋮ The quickest path problem with interval lead times ⋮ Stochastic convergence of random search methods to fixed size Pareto front approximations ⋮ A two-criterion lexicographic algorithm for finding all shortest paths in networks ⋮ A preference-based approach to spanning trees and shortest paths problems ⋮ A relation of dominance for the bicriterion bus routing problem ⋮ Multicriteria adaptive paths in stochastic, time-varying networks ⋮ On algorithms for the tricriteria shortest path problem with two bottleneck objective functions ⋮ On finding dissimilar Pareto-optimal paths ⋮ Theoretical and practical fundamentals for multi-objective optimisation in resource-constrained project scheduling problems ⋮ Minimum cost path problems with relays ⋮ On single-source capacitated facility location with cost and fairness objectives ⋮ Least expected time paths in stochastic schedule-based transit networks ⋮ Maximum probabilistic all-or-nothing paths ⋮ A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks ⋮ Finding non-dominated bicriteria shortest pairs of disjoint simple paths ⋮ The tricriterion shortest path problem with at least two bottleneck objective functions ⋮ An empirical investigation of some bicriterion shortest path algorithms ⋮ Solving combinatorial problems with combined min-max-min-sum objective and applications ⋮ Speed-up techniques for solving large-scale biobjective TSP ⋮ Dynamic programming bi-criteria combinatorial optimization ⋮ On uniform \(k\)-partition problems ⋮ On a multicriteria shortest path problem ⋮ On a special class of bicriterion path problems ⋮ Minmax regret solutions for minimax optimization problems with uncertainty ⋮ Approximate tradeoffs on weighted labeled matroids ⋮ Efficiently computing succinct trade-off curves ⋮ Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite ⋮ An interactive procedure using domination cones for bicriterion shortest path problems ⋮ A linear time algorithm for the maximum capacity path problem ⋮ A parametric approach to solving bicriterion shortest path problems ⋮ Multi-objective dynamic programming with limited precision
This page was built for publication:
