Pages that link to "Item:Q1077332"

The following pages link to The shortest path problem with two objective functions (Q1077332):

Displayed 34 items.

• C-programming and the minimization of pseudolinear and additive concave functions (Q579142) ‎ (← links)
• Routing with nonlinear multiattribute cost functions (Q686201) ‎ (← links)
• A parametric approach to solving bicriterion shortest path problems (Q810382) ‎ (← links)
• Discrete dynamic programming with outcomes in random variable structures (Q857283) ‎ (← links)
• Generalized dynamic programming for multicriteria optimization (Q908857) ‎ (← links)
• An interactive approach to identify the best compromise solution for two objective shortest path problems (Q912767) ‎ (← links)
• Optimal paths in bi-attribute networks with fractional cost functions (Q928022) ‎ (← links)
• A comparison of solution strategies for biobjective shortest path problems (Q958463) ‎ (← links)
• A new model for path planning with interval data (Q1000974) ‎ (← links)
• A new look at fractional programming (Q1078093) ‎ (← links)
• New approach for nonseparable dynamic programming problems (Q1117146) ‎ (← links)
• C-programming: A nonlinear parametric optimization method (Q1119478) ‎ (← links)
• Extension of dynamic programming to nonseparable dynamic optimization problems (Q1179356) ‎ (← links)
• A multicriteria Pareto-optimal path algorithm (Q1196025) ‎ (← links)
• Network reduction for the acyclic constrained shortest path problem (Q1206607) ‎ (← links)
• Low earth orbit satellite based communication systems -- research opportunities (Q1278815) ‎ (← links)
• An interactive procedure using domination cones for bicriterion shortest path problems (Q1317170) ‎ (← links)
• The median tour and maximal covering tour problems: Formulations and heuristics (Q1328602) ‎ (← links)
• The most critical path in a PERT network: A heuristic approach (Q1341990) ‎ (← links)
• Paths with minimum range and ratio of arc lengths (Q1377658) ‎ (← links)
• On the sum-max bicriterion path problem. (Q1406718) ‎ (← links)
• Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite (Q1598722) ‎ (← links)
• A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks (Q1806861) ‎ (← links)
• An empirical investigation of some bicriterion shortest path algorithms (Q1823874) ‎ (← links)
• Infrastructure development for conversion to environmentally friendly fuel (Q1847257) ‎ (← links)
• Multiobjective routing problems (Q1919112) ‎ (← links)
• Experiments with dynamic programming algorithms for nonseparable problems (Q2367363) ‎ (← links)
• Multiobjective transportation network design and routing problems: Taxonomy and annotation (Q2368289) ‎ (← links)
• Decision-making based on approximate and smoothed Pareto curves (Q2371803) ‎ (← links)
• A survey of recent developments in multiobjective optimization (Q2468335) ‎ (← links)
• Nodal aggregation of resource constraints in a shortest path problem (Q2490165) ‎ (← links)
• Multicriteria adaptive paths in stochastic, time-varying networks (Q2491770) ‎ (← links)
• The determination of the path with minimum-cost norm value (Q4419275) ‎ (← links)
• Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms (Q5308327) ‎ (← links)