Pages that link to "Item:Q5945392"

The following pages link to A simple efficient approximation scheme for the restricted shortest path problem (Q5945392):

Displaying 39 items.

• When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem (Q255267) (← links)
• Single machine scheduling with two competing agents and equal job processing times (Q319290) (← links)
• Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths (Q328701) (← links)
• An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem (Q398866) (← links)
• New approaches to multi-objective optimization (Q403670) (← links)
• Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
• Polynomial time approximation schemes for the constrained minimum spanning tree problem (Q442910) (← links)
• Fast approximation algorithms for routing problems with hop-wise constraints (Q490222) (← links)
• A note on approximating the min-max vertex disjoint paths on directed acyclic graphs (Q657914) (← links)
• Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications (Q841630) (← links)
• A PTAS for weight constrained Steiner trees in series--parallel graphs. (Q1401399) (← links)
• A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. (Q1426727) (← links)
• An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem (Q1664248) (← links)
• Multi-criteria approximation schemes for the resource constrained shortest path problem (Q1749776) (← links)
• Discrete representation of the non-dominated set for multi-objective optimization problems using kernels (Q1753501) (← links)
• A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation (Q1761961) (← links)
• Trajectory planning for unmanned aerial vehicles: a network optimization approach (Q1935911) (← links)
• One-exact approximate Pareto sets (Q2038919) (← links)
• Mobile facility location: combinatorial filtering via weighted occupancy (Q2251136) (← links)
• Bi-criteria path problem with minimum length and maximum survival probability (Q2284640) (← links)
• Maximum probabilistic all-or-nothing paths (Q2286936) (← links)
• Improved approximation algorithms for computing \(k\) disjoint paths subject to two constraints (Q2354302) (← links)
• Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context (Q2371346) (← links)
• Approximation schemes for a class of subset selection problems (Q2381527) (← links)
• A general approximation method for bicriteria minimization problems (Q2402670) (← 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)
• Approximation algorithms and hardness results for labeled connectivity problems (Q2426652) (← links)
• Efficiently computing succinct trade-off curves (Q2581275) (← links)
• Finding cheapest deadline paths (Q2695315) (← links)
• The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks (Q2943828) (← links)
• Approximating the Restricted 1-Center in Graphs (Q3467877) (← links)
• Effective Algorithms for a Class of Discrete Valued Optimal Control Problems (Q3589728) (← links)
• Constrained Steiner trees in Halin graphs (Q4467896) (← links)
• Simple paths with exact and forbidden lengths (Q4562938) (← links)
• Approximation Methods for Multiobjective Optimization Problems: A Survey (Q5084597) (← links)
• On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow (Q5119381) (← links)
• Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms (Q5308327) (← links)
• (Q5743388) (← links)