Pages that link to "Item:Q1077332"
From MaRDI portal
The following pages link to The shortest path problem with two objective functions (Q1077332):
Displaying 50 items.
- A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem (Q337491) (← links)
- Multi-postpath-based lookahead multiconstraint QoS routing (Q378623) (← links)
- Fast approximation algorithms for routing problems with hop-wise constraints (Q490222) (← links)
- Maximum probability shortest path problem (Q491594) (← links)
- C-programming and the minimization of pseudolinear and additive concave functions (Q579142) (← links)
- Enabling local computation for partially ordered preferences (Q606907) (← 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)
- On algorithms for the tricriteria shortest path problem with two bottleneck objective functions (Q976042) (← 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 bi-objective shortest path approach: Searching for unsupported nondominated solutions (Q1304515) (← 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)
- Shortest paths with shortest detours. A biobjective routing problem (Q1673931) (← links)
- Variable-sized uncertainty and inverse problems in robust optimization (Q1694311) (← links)
- Robust scheduling on a single machine to minimize total flow time (Q1762157) (← 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)
- A general decomposition approach for multi-criteria decision trees (Q1926761) (← links)
- A relation of dominance for the bicriterion bus routing problem (Q2012147) (← 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)
- Algorithm robust for the bicriteria discrete optimization problem (Q2379865) (← 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)
- An exact method for the biobjective shortest path problem for large-scale road networks (Q2630225) (← links)
- A fully polynomial time approximation scheme for the probability maximizing shortest path problem (Q2670558) (← links)
- Local Computation Schemes with Partially Ordered Preferences (Q3638136) (← links)
- Efficiently Generating k-Best Solutions to Procurement Auctions (Q3638445) (← links)
- Solving min-max shortest-path problems on a network (Q4018281) (← links)
