Pages that link to "Item:Q4093231"

The following pages link to An Integer Programming Approach to the Vehicle Scheduling Problem (Q4093231):

Displaying 50 items.

• Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445) (← links)
• A hybrid heuristic for the set covering problem (Q373244) (← links)
• A multi-space sampling heuristic for the vehicle routing problem with stochastic demands (Q375990) (← links)
• A branch and bound algorithm for the capacitated vehicle routing problem (Q585095) (← links)
• A Lagrangean relaxation heuristic for vehicle routing (Q593987) (← links)
• Solving a continuous local access network design problem with a stabilized central column generation approach (Q635164) (← links)
• Polyhedral study of the capacitated vehicle routing problem (Q688914) (← links)
• Solving the minimum convex partition of point sets with integer programming (Q824341) (← links)
• Adaptive memory programming for the vehicle routing problem with multiple trips (Q850308) (← links)
• Generating, scheduling and rostering of shift crew-duties: applications at the Hong Kong international airport (Q857315) (← links)
• A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry (Q878576) (← links)
• An adaptive memory algorithm for the split delivery vehicle routing problem (Q972645) (← links)
• A branch-and-price algorithm for an integrated production and inventory routing problem (Q991383) (← links)
• Developing work schedules for an inter-city transit system with multiple driver types and fleet types (Q1011229) (← links)
• The train driver recovery problem-a set partitioning based model and solution method (Q1046697) (← links)
• Vehicle routing via column generation (Q1058983) (← links)
• Implementation techniques for the vehicle routing problem (Q1086140) (← links)
• The savings algorithm for the vehicle routing problem (Q1097832) (← links)
• On the integer properties of scheduling set partitioning models (Q1100095) (← links)
• A bi-criteria heuristic for the vehicle routing problem with time windows (Q1102175) (← links)
• Enhancing an algorithm for set covering problems (Q1194745) (← links)
• The vehicle routing problem: An overview of exact and approximate algorithms (Q1198313) (← links)
• A structure for distribution studies (Q1243215) (← links)
• Algorithms for large scale set covering problems (Q1309874) (← links)
• A surrogate heuristic for set covering problems (Q1342046) (← links)
• A TSSP+1 decomposition strategy for the vehicle routing problem (Q1342652) (← links)
• Supply chain optimization in the pulp mill industry -- IP models, column generation and novel constraint branches. (Q1426678) (← links)
• A binary cat swarm optimization algorithm for the non-unicost set covering problem (Q1666040) (← links)
• A matheuristic for the asymmetric capacitated vehicle routing problem (Q1686058) (← links)
• Heuristics for vehicle routing problems: sequence or set optimization? (Q1722969) (← links)
• Simulation-based evolution of resupply and routing policies in rich vendor-managed inventory scenarios (Q1788909) (← links)
• An algorithm for set covering problem (Q1823139) (← links)
• A sweep-based algorithm for the fleet size and mix vehicle routing problem (Q1848592) (← links)
• The home care crew scheduling problem: preference-based visit clustering and temporal dependencies (Q1926679) (← links)
• The column-circular, subsets-selection problem: Complexity and solutions (Q1974273) (← links)
• The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (Q1991101) (← links)
• Column generation for minimizing total completion time in a parallel-batching environment (Q2066680) (← links)
• An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem (Q2099500) (← links)
• Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange (Q2289919) (← links)
• Simultaneous disruption recovery of a train timetable and crew roster in real time (Q2387256) (← links)
• Scheduling trainees at a hospital department using a branch-and-price approach (Q2432850) (← links)
• A branch-and-price approach for operational aircraft maintenance routing (Q2433558) (← links)
• A branch-and-price approach for integrating nurse and surgery scheduling (Q2482743) (← links)
• A survey on matheuristics for routing problems (Q2513752) (← links)
• Vehicle routing on road networks: how good is Euclidean approximation? (Q2668618) (← links)
• Forty years of periodic vehicle routing (Q2811320) (← links)
• The Period Vehicle Routing Problem and its Extensions (Q3564350) (← links)
• A generalized exchange heuristic for the capacitated vehicle routing problem (Q4697853) (← links)
• A self-adaptive biogeography-based algorithm to solve the set covering problem (Q5242281) (← links)
• A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs (Q5266610) (← links)