Pages that link to "Item:Q908857"
From MaRDI portal
The following pages link to Generalized dynamic programming for multicriteria optimization (Q908857):
Displayed 31 items.
- Optimal path problems with second-order stochastic dominance constraints (Q264233) (← links)
- Stability on multiobjective dynamic programming problems with fuzzy parameters in the objective functions and in the constraints (Q596280) (← links)
- Multi-objective and multi-constrained non-additive shortest path problems (Q609807) (← links)
- Decision making with multiple objectives using GAI networks (Q646528) (← links)
- Dynamic programming bi-criteria combinatorial optimization (Q777429) (← links)
- Bicriteria shortest path in networks of queues (Q861124) (← links)
- Optimal paths in bi-attribute networks with fractional cost functions (Q928022) (← links)
- Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming (Q1185994) (← links)
- Multiobjective, preference-based search in acyclic OR-graphs (Q1197940) (← links)
- Modeling uncertainty in networks (Q1310211) (← links)
- Dynamic programming approach to multiple objective control problem having deterministic or fuzzy goals (Q1313058) (← links)
- A neural network technique in modeling multiple criteria multiple person decision making (Q1318509) (← links)
- An improved interactive hybrid method for the linear multi-objective knapsack problem (Q1374024) (← links)
- Multicriteria heuristic search. (Q1405227) (← links)
- The interactive analysis of the multicriteria shortest path problem by the reference point method. (Q1406958) (← links)
- Multicriteria stochastic shortest path problem for electric vehicles (Q1642961) (← links)
- Dynamic shortest path in stochastic dynamic networks: Ship routing problem (Q1869695) (← links)
- A general decomposition approach for multi-criteria decision trees (Q1926761) (← links)
- A relation of dominance for the bicriterion bus routing problem (Q2012147) (← links)
- A dynamic programming approach to a multi-objective disassembly line balancing problem (Q2150762) (← links)
- Extensions of dynamic programming for multi-stage combinatorial optimization (Q2205944) (← links)
- Experiments with dynamic programming algorithms for nonseparable problems (Q2367363) (← links)
- Multiobjective transportation network design and routing problems: Taxonomy and annotation (Q2368289) (← links)
- An interactive algorithm for decomposing the parametric space in fuzzy multiobjective dynamic programming problem (Q2490241) (← links)
- Multicriteria adaptive paths in stochastic, time-varying networks (Q2491770) (← links)
- An exact method for the biobjective shortest path problem for large-scale road networks (Q2630225) (← links)
- The transit time constrained fixed charge multi-commodity network design problem (Q2669603) (← links)
- Multi‐objective optimization using metaheuristics: non‐standard algorithms (Q4918257) (← links)
- Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms (Q5308327) (← links)
- Label correcting methods to solve multicriteria shortest path problems (Q5956971) (← links)