Pages that link to "Item:Q5493627"

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

Displaying 50 items.

• The orienteering problem with time windows applied to robotic melon harvesting (Q255095) (← links)
• The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem (Q296774) (← links)
• An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems (Q319714) (← links)
• A comparison of column-generation approaches to the synchronized pickup and delivery problem (Q319923) (← links)
• The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach (Q320623) (← links)
• A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times (Q320872) (← links)
• Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
• The electric fleet size and mix vehicle routing problem with time windows and recharging stations (Q323018) (← links)
• Lifted and local reachability cuts for the vehicle routing problem with time windows (Q336427) (← links)
• Single liner shipping service design (Q336948) (← links)
• A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (Q337090) (← links)
• A new formulation and approach for the black and white traveling salesman problem (Q337265) (← links)
• A branch-and-price approach for a multi-period vehicle routing problem (Q337422) (← links)
• A branch-price-and-cut algorithm for the workover rig routing problem (Q339692) (← links)
• A branch-price-and-cut method for a ship routing and scheduling problem with split loads (Q339703) (← links)
• Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039) (← links)
• A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem (Q342059) (← links)
• Solving resource constrained shortest path problems with LP-based methods (Q342436) (← links)
• A branch and price approach for deployment of multi-tier software services in clouds (Q342499) (← links)
• Integrated airline crew scheduling: a bi-dynamic constraint aggregation method using neighborhoods (Q421554) (← links)
• Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems (Q439646) (← links)
• Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
• A complete characterization of jump inequalities for the hop-constrained shortest path problem (Q528561) (← links)
• Multi-objective and multi-constrained non-additive shortest path problems (Q609807) (← links)
• A note on branch-and-cut-and-price (Q613321) (← links)
• A tutorial on column generation and branch-and-price for vehicle routing problems (Q633483) (← links)
• Optimizing vessel fleet size and mix to support maintenance operations at offshore wind farms (Q666958) (← links)
• Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies (Q666967) (← links)
• Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← links)
• Stabilized branch-and-price algorithms for vector packing problems (Q724108) (← links)
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (Q847836) (← links)
• Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation (Q856697) (← links)
• The aircraft routing problem with refueling (Q895787) (← links)
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times (Q955327) (← links)
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming (Q958452) (← links)
• Multi-phase dynamic constraint aggregation for set partitioning type problems (Q964175) (← links)
• A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows (Q976316) (← links)
• A hybrid scatter search heuristic for personalized crew rostering in the airline industry (Q976415) (← links)
• Mathematical models and solution methods for optimal container terminal yard layouts (Q989631) (← links)
• Combining discrete SVM and fixed cardinality warping distances for multivariate time series classification (Q991257) (← links)
• A branch-and-price algorithm for an integrated production and inventory routing problem (Q991383) (← links)
• A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
• Task assignment with start time-dependent processing times for personnel at check-in counters (Q1617296) (← links)
• Tramp ship routing and scheduling with voyage separation requirements (Q1642055) (← links)
• Full-shipload tramp ship routing and scheduling with variable speeds (Q1651617) (← links)
• Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem (Q1651640) (← links)
• A new heuristic branching scheme for the crew pairing problem with base constraints (Q1652206) (← links)
• A column generation approach for the location-routing problem with time windows (Q1652527) (← links)
• A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
• A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs (Q1652714) (← links)