Pages that link to "Item:Q1752776"

The following pages link to The pickup and delivery traveling salesman problem with handling costs (Q1752776):

Displaying 10 items.

• Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review (Q1730669) (← links)
• Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints (Q2074672) (← links)
• The pickup and delivery problem with time windows, multiple stacks, and handling operations (Q2140213) (← links)
• The vehicle routing problem with simultaneous pickup and delivery and handling costs (Q2289929) (← links)
• Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2670579) (← links)
• A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs (Q6064162) (← links)
• The double traveling salesman problem with partial last‐in‐first‐out loading constraints (Q6071059) (← links)
• A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints (Q6080619) (← links)
• A nonlinear optimization model for the balanced vehicle routing problem with loading constraints (Q6088117) (← links)
• A metaheuristic algorithm for a locomotive routing problem arising in the steel industry (Q6167423) (← links)