Pages that link to "Item:Q1652580"
From MaRDI portal
The following pages link to A branch-and-price algorithm for the minimum latency problem (Q1652580):
Displaying 28 items.
- Minimizing customers' waiting time in a vehicle routing problem with unit demands (Q1742415) (← links)
- Minimizing the average searching time for an object within a graph (Q2007833) (← links)
- Tree optimization based heuristics and metaheuristics in network construction problems (Q2027081) (← links)
- Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
- Projection heuristics for binary branchings between sum and product (Q2118310) (← links)
- New formulations and solution approaches for the latency location routing problem (Q2147033) (← links)
- The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
- A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network (Q2197321) (← links)
- Weighted online minimum latency problem with edge uncertainty (Q2239843) (← links)
- Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier (Q2422737) (← links)
- An online optimization approach for post-disaster relief distribution with online blocked edges (Q2669638) (← links)
- Routing multiple work teams to minimize latency in post-disaster road network restoration (Q2670582) (← links)
- A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2688881) (← links)
- Branch-and-price algorithm for a multicast routing problem (Q3154433) (← links)
- Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty (Q5003707) (← links)
- Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651) (← links)
- Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling (Q5087720) (← links)
- Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND (Q6070871) (← links)
- Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining (Q6070880) (← links)
- Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization (Q6073272) (← links)
- Selective arc‐ng pricing for vehicle routing (Q6092607) (← links)
- Branch-and-price algorithms for large-scale mission-oriented maintenance planning problems (Q6109390) (← links)
- Certified dominance and symmetry breaking for combinatorial optimisation (Q6488808) (← links)
- A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery (Q6551059) (← links)
- Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates (Q6554640) (← links)
- PathWyse: a flexible, open-source library for the resource constrained shortest path problem (Q6586912) (← links)
- Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff (Q6667800) (← links)
