Pages that link to "Item:Q3762099"
From MaRDI portal
The following pages link to Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems (Q3762099):
Displaying 46 items.
- Multiobjective transportation network design and routing problems: Taxonomy and annotation (Q2368289) (← links)
- Multiobjective routing of hazardous materials in stochastic networks (Q2368293) (← links)
- Decision-making based on approximate and smoothed Pareto curves (Q2371803) (← links)
- On the cardinality of the Pareto set in bicriteria shortest path problems (Q2379876) (← links)
- A discussion of scalarization techniques for multiple objective integer programming (Q2379880) (← links)
- Approximation schemes for a class of subset selection problems (Q2381527) (← links)
- On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks (Q2402675) (← links)
- Approximating the restricted 1-center in graphs (Q2424875) (← links)
- Competitive algorithms for the bicriteria \(k\)-server problem (Q2433801) (← links)
- The subdivision-constrained routing requests problem (Q2436672) (← links)
- Finding representative systems for discrete bicriterion optimization problems (Q2467474) (← links)
- A survey of recent developments in multiobjective optimization (Q2468335) (← links)
- On local optima in multiobjective combinatorial optimization problems (Q2468765) (← links)
- Nodal aggregation of resource constraints in a shortest path problem (Q2490165) (← links)
- Multicriteria adaptive paths in stochastic, time-varying networks (Q2491770) (← links)
- Bounded-hops power assignment in ad hoc wireless networks (Q2492211) (← links)
- Bulk-robust combinatorial optimization (Q2515045) (← links)
- Efficiently computing succinct trade-off curves (Q2581275) (← links)
- Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem (Q2581622) (← links)
- On budget-constrained flow improvement. (Q2583570) (← links)
- Vehicle routing problems with alternative paths: an application to on-demand transportation (Q2654320) (← links)
- Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points (Q2664305) (← links)
- Simple and efficient bi-objective search algorithms via fast dominance checks (Q2680770) (← links)
- Finding cheapest deadline paths (Q2695315) (← links)
- Redundancy elimination in the estimation of multiple paths (Q2722583) (← links)
- The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks (Q2943828) (← links)
- Improving the solution complexity of the scheduling problem with deadlines: A general technique (Q2954334) (← links)
- Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming (Q3216467) (← links)
- Approximating the Restricted 1-Center in Graphs (Q3467877) (← links)
- Efficiently Generating k-Best Solutions to Procurement Auctions (Q3638445) (← links)
- Bicriterion Shortest Paths in Stochastic Time-Dependent Networks (Q3649590) (← links)
- Approximation of a set of Pareto-optimal solutions (Q3755244) (← links)
- Bicriteria Network Design Problems (Q4216149) (← links)
- The determination of the path with minimum-cost norm value (Q4419275) (← links)
- Simple paths with exact and forbidden lengths (Q4562938) (← links)
- Dynamic programming approaches to solve the shortest path problem with forbidden paths (Q4924113) (← links)
- Facility location with dynamic distance functions (Q5054838) (← links)
- Approximation Methods for Multiobjective Optimization Problems: A Survey (Q5084597) (← links)
- Routing of electric vehicles: constrained shortest path problems with resource recovering nodes (Q5240194) (← links)
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms (Q5308327) (← links)
- (Q5743388) (← links)
- Fundamentals of Computation Theory (Q5900784) (← links)
- A simple efficient approximation scheme for the restricted shortest path problem (Q5945392) (← links)
- Label correcting methods to solve multicriteria shortest path problems (Q5956971) (← links)
- Compact location problems with budget and communication constraints (Q6064048) (← links)
- Modifying networks to obtain low cost trees (Q6550552) (← links)