The shortest path problem with two objective functions
From MaRDI portal
Publication:1077332
DOI10.1016/0377-2217(86)90092-5zbMath0594.90087MaRDI QIDQ1077332
Publication date: 1986
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(86)90092-5
branch and bound; nondominated paths; quasiconvex utility functions; shortest path in a network; two objective functions
90C35: Programming involving graphs or networks
05C35: Extremal problems in graph theory
90C31: Sensitivity, stability, parametric optimization
90B50: Management decision making, including multiple objectives
91B16: Utility theory
Related Items
The determination of the path with minimum-cost norm value, Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms, C-programming and the minimization of pseudolinear and additive concave functions, Routing with nonlinear multiattribute cost functions, A parametric approach to solving bicriterion shortest path problems, Discrete dynamic programming with outcomes in random variable structures, Generalized dynamic programming for multicriteria optimization, 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, A new model for path planning with interval data, A new look at fractional programming, New approach for nonseparable dynamic programming problems, C-programming: A nonlinear parametric optimization method, Extension of dynamic programming to nonseparable dynamic optimization problems, A multicriteria Pareto-optimal path algorithm, Network reduction for the acyclic constrained shortest path problem, Low earth orbit satellite based communication systems -- research opportunities, An interactive procedure using domination cones for bicriterion shortest path problems, The median tour and maximal covering tour problems: Formulations and heuristics, The most critical path in a PERT network: A heuristic approach, Paths with minimum range and ratio of arc lengths, On the sum-max bicriterion path problem., Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite, A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks, An empirical investigation of some bicriterion shortest path algorithms, Infrastructure development for conversion to environmentally friendly fuel, Multiobjective routing problems, Experiments with dynamic programming algorithms for nonseparable problems, Multiobjective transportation network design and routing problems: Taxonomy and annotation, Decision-making based on approximate and smoothed Pareto curves, A survey of recent developments in multiobjective optimization, Nodal aggregation of resource constraints in a shortest path problem, Multicriteria adaptive paths in stochastic, time-varying networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A bicriterion shortest path algorithm
- Dynamic programming in multiplicative lattices
- Validity of Local Search in Multiparametric and Vector Linear Programming
- Combinatorial Optimization with Rational Objective Functions
- Note on Multiple Objective Dynamic Programming
- Preference Order Dynamic Programming
- Ordinal Dynamic Programming
- Multidimensional Line Search Using a Binary Preference Relation
- Contraction Mappings in the Theory Underlying Dynamic Programming
- Sur L'enveloppe convexe des nuages de points aleatoires dans Rn. I
