Pages that link to "Item:Q2001858"

The following pages link to Perspectives on integer programming for time-dependent models (Q2001858):

Displaying 12 items.

• Comments on: ``Perspectives on integer programming for time-dependent models'' (Q2001859) (← links)
• Rejoinder on: ``Perspectives on integer programming for time-dependent models'' (Q2001860) (← links)
• Time-dependent stochastic vehicle routing problem with random requests: application to online police patrol management in Brussels (Q2030456) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
• Shared resources in collaborative vehicle routing (Q2307318) (← links)
• Dynamic discretization discovery for solving the continuous time inventory routing problem with out-and-back routes (Q2669743) (← links)
• Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110) (← links)
• An exact algorithm for the service network design problem with hub capacity constraints (Q6085889) (← links)
• Exact and anytime approach for solving the time dependent traveling salesman problem with time windows (Q6096613) (← links)
• Scalable timing-aware network design via Lagrangian decomposition (Q6112744) (← links)
• Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows (Q6113315) (← links)
• A MaxSAT approach for solving a new dynamic discretization discovery model for train rescheduling problems (Q6568503) (← links)