Pages that link to "Item:Q5493627"

The following pages link to Shortest Path Problems with Resource Constraints (Q5493627):

Displaying 50 items.

• Bi-criteria path problem with minimum length and maximum survival probability (Q2284640) (← links)
• Bidirectional labeling for solving vehicle routing and truck driver scheduling problems (Q2286924) (← links)
• Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange (Q2289919) (← links)
• A branch-and-price heuristic for the crew pairing problem with language constraints (Q2294642) (← links)
• Lagrangian relaxation for the multiple constrained robust shortest path problem (Q2298370) (← links)
• An exact solution method for the capacitated item-sharing and crowdshipping problem (Q2312351) (← links)
• Solving the selective multi-category parallel-servicing problem (Q2341388) (← links)
• Delay-constrained shortest paths: approximation algorithms and second-order cone models (Q2342143) (← links)
• Branch-and-price for staff rostering: an efficient implementation using generic programming and nested column generation (Q2355925) (← links)
• A heuristic for cumulative vehicle routing using column generation (Q2357169) (← links)
• Algorithms for non-linear and stochastic resource constrained shortest path (Q2417959) (← links)
• Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier (Q2422737) (← links)
• Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem (Q2424767) (← links)
• Solving elementary shortest-path problems as mixed-integer programs (Q2454365) (← links)
• Bi-dynamic constraint aggregation and subproblem reduction (Q2459403) (← links)
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints (Q2465940) (← links)
• An exact algorithm for team orienteering problems (Q2477614) (← links)
• Resource extension functions: properties, inversion, and generalization to segments (Q2480803) (← links)
• Nodal aggregation of resource constraints in a shortest path problem (Q2490165) (← links)
• A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2514732) (← links)
• A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes (Q2514736) (← links)
• New approaches to nurse rostering benchmark instances (Q2514811) (← links)
• Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
• Freight railway operator timetabling and engine scheduling (Q2629669) (← links)
• Vehicle routing problems with alternative paths: an application to on-demand transportation (Q2654320) (← links)
• A new branch-and-price algorithm for the traveling tournament problem (Q2655609) (← links)
• Solving a rich vehicle routing and inventory problem using column generation (Q2655647) (← links)
• Multi-objective temporal bin packing problem: an application in cloud computing (Q2664301) (← links)
• Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen (Q2664412) (← links)
• An approach to the distributionally robust shortest path problem (Q2668652) (← links)
• Solution approaches for integrated vehicle and crew scheduling with electric buses (Q2668717) (← links)
• The joint network vehicle routing game with optional customers (Q2668799) (← links)
• Selective routing problem with synchronization (Q2669549) (← links)
• A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts (Q2669559) (← links)
• A column generation tailored to electric vehicle routing problem with nonlinear battery depreciation (Q2669635) (← links)
• Deep-learning-based partial pricing in a branch-and-price algorithm for personalized crew rostering (Q2669662) (← links)
• On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage (Q2673804) (← links)
• The structural complexity landscape of finding balance-fair shortest paths (Q2676473) (← links)
• A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2688881) (← links)
• (Q2753949) (← links)
• Dual inequalities for stabilized column generation revisited (Q2806874) (← links)
• A survey of resource constrained shortest path problems: exact solution approaches (Q2811308) (← links)
• A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem (Q2811322) (← links)
• The fixed-charge shortest-path problem (Q2815469) (← links)
• The team orienteering pick-up and delivery problem with time windows and its applications in fleet sizing (Q2826662) (← links)
• Complexity of column generation in network design with path-based survivability mechanisms (Q2892152) (← links)
• Optimization in Designing Complex Communication Networks (Q2913773) (← links)
• Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows (Q2957464) (← links)
• On the complexity of resilient network design (Q3057137) (← links)
• Optimal routing with failure-independent path protection (Q3057139) (← links)