Pages that link to "Item:Q4367254"

The following pages link to On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows (Q4367254):

Displaying 19 items.

• Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems (Q439646) (← links)
• Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
• Flow-based integer linear programs to solve the weekly log-truck scheduling problem (Q748554) (← links)
• A column generation approach to the heterogeneous fleet vehicle routing problem (Q868147) (← links)
• Pruning in column generation for service vehicle dispatching (Q940899) (← links)
• A dual ascent procedure for the set partitioning problem (Q955334) (← links)
• A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles (Q1582189) (← links)
• Combinatorial optimization: current successes and directions for the future (Q1593834) (← links)
• Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (Q1695015) (← links)
• A route-neighborhood-based metaheuristic for vehicle routing problem with time windows (Q1806612) (← links)
• A model to optimize placement operations on dual-head placement machines (Q2467135) (← links)
• A LP-based heuristic for a time-constrained routing problem (Q2491773) (← links)
• Survey of research in the design and control of automated guided vehicle systems (Q2575559) (← links)
• Chance-constrained set covering with Wasserstein ambiguity (Q2687060) (← links)
• Linear temporal logic vehicle routing with applications to multi-UAV mission planning (Q2903986) (← links)
• Column-Generation in Integer Linear Programming (Q4450558) (← links)
• Covering Problems (Q5506721) (← links)
• Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows (Q6065830) (← links)
• A modeling framework for incorporating DEA efficiency into set covering, packing, and partitioning formulations (Q6066659) (← links)