Pages that link to "Item:Q1947199"
From MaRDI portal
The following pages link to The time dependent traveling salesman problem: polyhedra and algorithm (Q1947199):
Displaying 28 items.
- An integrated approach for earthwork allocation, sequencing and routing (Q296873) (← links)
- Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
- A minmax regret version of the time-dependent shortest path problem (Q724002) (← 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)
- 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)
- Minimizing customers' waiting time in a vehicle routing problem with unit demands (Q1742415) (← links)
- Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
- Identification of unidentified equality constraints for integer programming problems (Q1753456) (← links)
- A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
- Variable neighborhood search for the travelling deliveryman problem (Q1942008) (← links)
- Perspectives on integer programming for time-dependent models (Q2001858) (← links)
- A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints (Q2029262) (← links)
- Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
- Dealing with time in the multiple traveling salespersons problem with moving targets (Q2155136) (← links)
- The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
- Exact algorithms for the traveling salesman problem with draft limits (Q2256207) (← links)
- Models and algorithms for the traveling salesman problem with time-dependent service times (Q2294625) (← links)
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110) (← links)
- A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2688881) (← links)
- An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem (Q5242274) (← links)
- Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND (Q6070871) (← links)
- Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization (Q6073272) (← links)
- Tight lower bounds for the traveling salesman problem with draft limits (Q6109566) (← links)
- An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem (Q6113360) (← links)
- A bi-criteria moving-target travelling salesman problem under uncertainty (Q6167752) (← links)
