Generalized dynamic programming for multicriteria optimization
From MaRDI portal
Publication:908857
DOI10.1016/0377-2217(90)90318-6zbMath0693.90090OpenAlexW2086842401MaRDI QIDQ908857
Robert L. Carraway, Thomas L. Morin, Herbert Moskowitz
Publication date: 1990
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(90)90318-6
Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31) Dynamic programming (90C39)
Related Items
Optimal path problems with second-order stochastic dominance constraints, Experiments with dynamic programming algorithms for nonseparable problems, Multiobjective transportation network design and routing problems: Taxonomy and annotation, An exact method for the biobjective shortest path problem for large-scale road networks, Multicriteria stochastic shortest path problem for electric vehicles, A dynamic programming approach to a multi-objective disassembly line balancing problem, Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms, Bicriteria shortest path in networks of queues, An improved interactive hybrid method for the linear multi-objective knapsack problem, Stability on multiobjective dynamic programming problems with fuzzy parameters in the objective functions and in the constraints, Network Models for Multiobjective Discrete Optimization, Multi-objective and multi-constrained non-additive shortest path problems, The transit time constrained fixed charge multi-commodity network design problem, A general decomposition approach for multi-criteria decision trees, Multicriteria heuristic search., The interactive analysis of the multicriteria shortest path problem by the reference point method., Extensions of dynamic programming for multi-stage combinatorial optimization, Decision making with multiple objectives using GAI networks, Optimal paths in bi-attribute networks with fractional cost functions, Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming, Multiobjective, preference-based search in acyclic OR-graphs, Multi‐objective optimization using metaheuristics: non‐standard algorithms, An interactive algorithm for decomposing the parametric space in fuzzy multiobjective dynamic programming problem, A relation of dominance for the bicriterion bus routing problem, Multicriteria adaptive paths in stochastic, time-varying networks, Label correcting methods to solve multicriteria shortest path problems, Dynamic programming bi-criteria combinatorial optimization, Modeling uncertainty in networks, Dynamic programming approach to multiple objective control problem having deterministic or fuzzy goals, A neural network technique in modeling multiple criteria multiple person decision making, Dynamic shortest path in stochastic dynamic networks: Ship routing problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The shortest path problem with two objective functions
- Theory and applications of generalized dynamic programming: An overview
- An interactive dynamic programming approach to multicriteria discrete programming
- Dynamic programming and principles of optimality
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Generalized Dynamic Programming for Stochastic Combinatorial Optimization
- A Dynamic Programming Approach to Stochastic Assembly Line Balancing
- Measurable Multiattribute Value Functions
- Preference Order Dynamic Programming
- Branch-and-Bound Strategies for Dynamic Programming
- A hybrid approach to discrete mathematical programming
- Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
- Composition Principles for Synthesis of Optimal Multistage Processes
- Contraction Mappings in the Theory Underlying Dynamic Programming
