Pages that link to "Item:Q5493627"

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

Displaying 50 items.

• A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs (Q1652714) (← links)
• A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine (Q1653363) (← links)
• A profit-maximization location-routing-pricing problem: a branch-and-price algorithm (Q1653368) (← links)
• A branch-and-price approach to the feeder network design problem (Q1681514) (← links)
• Dynamic constraint and variable aggregation in column generation (Q1683120) (← links)
• A multi-start randomized heuristic for real-life crew rostering problems in airlines with work-balancing goals (Q1686533) (← links)
• Liner shipping service scheduling and cargo allocation (Q1719622) (← links)
• Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows (Q1725604) (← links)
• Integrating rolling stock scheduling with train unit shunting (Q1751830) (← links)
• Branch-and-price-and-cut for a service network design and hub location problem (Q1752143) (← links)
• Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster (Q1753599) (← links)
• Solving the team orienteering arc routing problem with a column generation approach (Q1754007) (← links)
• Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems (Q1754114) (← links)
• Oil production optimization solved by piecewise linearization in a branch \& price framework (Q1761184) (← links)
• Solving shortest path problems with a weight constraint and replenishment arcs (Q1762066) (← links)
• Exact algorithms for the chance-constrained vehicle routing problem (Q1800993) (← links)
• A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks (Q1935910) (← links)
• A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery (Q1983673) (← links)
• Routing a mix of conventional, plug-in hybrid, and electric vehicles (Q1991124) (← links)
• Column generation for vehicle routing problems with multiple synchronization constraints (Q1991183) (← links)
• The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology (Q1991213) (← links)
• Perspectives on integer programming for time-dependent models (Q2001858) (← links)
• An exact solution method for a rich helicopter flight scheduling problem arising in offshore oil and gas logistics (Q2027044) (← links)
• A personalized walking bus service requiring optimized route decisions: a real case (Q2029258) (← links)
• System optimal routing of traffic flows with user constraints using linear programming (Q2030327) (← links)
• An efficient column generation approach for practical railway crew scheduling with attendance rates (Q2030362) (← links)
• Real-time bi-objective personnel re-scheduling in the retail industry (Q2030505) (← links)
• Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes (Q2031089) (← links)
• Solving bin packing problems using VRPSolver models (Q2033390) (← links)
• Robust vehicle routing under uncertainty via branch-price-and-cut (Q2101653) (← links)
• An exact reduction technique for the k-colour shortest path problem (Q2108122) (← links)
• A unified exact approach for clustered and generalized vehicle routing problems (Q2108132) (← links)
• The pickup and delivery problem with time windows, multiple stacks, and handling operations (Q2140213) (← links)
• Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations (Q2147168) (← links)
• The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
• Exact algorithms to minimize makespan on single and parallel batch processing machines (Q2183850) (← links)
• Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach (Q2184040) (← links)
• Alternating Lagrangian decomposition for integrated airline crew scheduling problem (Q2189931) (← links)
• Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network (Q2197321) (← links)
• A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand (Q2208355) (← links)
• A rotation-based branch-and-price approach for the nurse scheduling problem (Q2220898) (← links)
• Dynamic constraint aggregation for solving very large-scale airline crew pairing problems (Q2226471) (← links)
• The inventory routing problem with demand moves (Q2226502) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
• A robust optimization approach with probe-able uncertainty (Q2239954) (← links)
• Stabilized dynamic constraint aggregation for solving set partitioning problems (Q2253353) (← links)
• Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
• Integer programming models for the multidimensional assignment problem with star costs (Q2256320) (← links)
• A graph partitioning strategy for solving large-scale crew scheduling problems (Q2260895) (← links)
• Exact solution of the soft-clustered vehicle-routing problem (Q2272311) (← links)