Pages that link to "Item:Q4016708"

The following pages link to Approximation Schemes for the Restricted Shortest Path Problem (Q4016708):

Displaying 50 items.

• When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem (Q255267) (← links)
• Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs (Q299837) (← links)
• Single machine scheduling with two competing agents and equal job processing times (Q319290) (← links)
• Minimum cost paths over dynamic networks (Q325482) (← links)
• Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price (Q339594) (← links)
• The capacity expansion path problem in networks (Q364264) (← links)
• Multi-postpath-based lookahead multiconstraint QoS routing (Q378623) (← 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)
• The most vital nodes with respect to independent set and vertex cover (Q411833) (← links)
• Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
• General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (Q429650) (← links)
• Polynomial time approximation schemes for the constrained minimum spanning tree problem (Q442910) (← links)
• Supply chain scheduling to minimize holding costs with outsourcing (Q490179) (← links)
• Fast approximation algorithms for routing problems with hop-wise constraints (Q490222) (← links)
• Approximation scheme for restricted discrete gate sizing targeting delay minimization (Q491218) (← links)
• Maximum probability shortest path problem (Q491594) (← links)
• Constrained shortest path with uncertain transit times (Q496598) (← links)
• The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles (Q497683) (← links)
• Bi-objective matchings with the triangle inequality (Q515541) (← links)
• An FPTAS for minimizing the product of two non-negative linear cost functions (Q623370) (← links)
• Approximating some network design problems with node costs (Q638508) (← links)
• A note on approximating the min-max vertex disjoint paths on directed acyclic graphs (Q657914) (← links)
• A generalized approximation framework for fractional network flow and packing problems (Q684147) (← links)
• A better approximation algorithm for the budget prize collecting tree problem. (Q703233) (← links)
• Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (Q833589) (← links)
• Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications (Q841630) (← links)
• Approximation algorithms for multi-agent scheduling to minimize total weighted completion time (Q989525) (← links)
• Complexity of single machine scheduling subject to nonnegative inventory constraints (Q992655) (← links)
• A new model for path planning with interval data (Q1000974) (← links)
• Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees (Q1017907) (← links)
• A polynomial solvable minimum risk spanning tree problem with interval data (Q1027578) (← links)
• Modifying edges of a network to obtain short subgraphs (Q1274323) (← links)
• Approximating the weight of shallow Steiner trees (Q1296580) (← 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)
• Approximation algorithms for multi-parameter graph optimization problems (Q1602708) (← links)
• A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← 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)
• Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks (Q1753463) (← links)
• A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation (Q1761961) (← links)
• An improved FPTAS for Restricted Shortest Path. (Q1853085) (← links)
• A computer-aided process planning model based on genetic algorithms (Q1906941) (← links)
• Errata and comments on ``Approximation algorithms for the capacitated plant allocation problem'' (Q1919191) (← links)
• Trajectory planning for unmanned aerial vehicles: a network optimization approach (Q1935911) (← links)
• Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax \(k\) vertex-disjoint paths in a directed acyclic graph (Q1959418) (← links)
• Approximation algorithms for constructing required subgraphs using stock pieces of fixed length (Q2082192) (← links)
• Scheduling two projects with controllable processing times in a single-machine environment (Q2215194) (← links)
• A just-in-time scheduling problem with two competing agents (Q2228372) (← links)