Pages that link to "Item:Q496646"

The following pages link to Natural and extended formulations for the time-dependent traveling salesman problem (Q496646):

Displaying 17 items.

• Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
• Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
• An integer programming approach for the time-dependent traveling salesman problem with time windows (Q1651554) (← links)
• The traveling purchaser problem with time-dependent quantities (Q1652259) (← links)
• A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment (Q1652330) (← links)
• A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
• Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem (Q1683126) (← links)
• Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
• Exact algorithms for the equitable traveling salesman problem (Q1753595) (← links)
• Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
• An enhanced lower bound for the time-dependent travelling salesman problem (Q2333147) (← links)
• On path ranking in time-dependent graphs (Q2669544) (← links)
• Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule (Q6065592) (← links)
• Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND (Q6070871) (← links)
• Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem (Q6091422) (← links)
• Tight lower bounds for the traveling salesman problem with draft limits (Q6109566) (← links)
• The travelling salesman problem with positional consistency constraints: an application to healthcare services (Q6167660) (← links)