Pages that link to "Item:Q1013413"
From MaRDI portal
The following pages link to Exploiting sparsity in pricing routines for the capacitated arc routing problem (Q1013413):
Displaying 21 items.
- Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← links)
- The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem (Q296774) (← links)
- Improved bounds for large scale capacitated arc routing problem (Q336459) (← links)
- Pricing routines for vehicle routing with time windows on road networks (Q337163) (← links)
- Using dual feasible functions to construct fast lower bounds for routing and location problems (Q499343) (← links)
- An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems (Q841604) (← links)
- A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands (Q1043246) (← links)
- Optimally solving the joint order batching and picker routing problem (Q1683118) (← links)
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics (Q1730649) (← links)
- Iterated local search and column generation to solve arc-routing as a permutation set-covering problem (Q1752200) (← links)
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem (Q1761166) (← links)
- Improved lower bounds and exact algorithm for the capacitated arc routing problem (Q1942278) (← links)
- Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem (Q2806992) (← links)
- Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories (Q2835664) (← links)
- A price-directed decomposition approach for solving large-scale capacitated part-routing problems (Q3163241) (← links)
- A Decade of Capacitated Arc Routing (Q3564348) (← links)
- Efficient algorithms under dynamic graphs to solve the Capacitated Arc Routing Problem with feasible sparse graph (Q5380984) (← links)
- An Algorithm For The Decomposition Of Arc Flows Into Path Flows For The General Spatial Price Equilibrium Problem (Q5750691) (← links)
- The time-dependent shortest path and vehicle routing problem (Q5889200) (← links)
- Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation (Q5962716) (← links)
- Arc routing problems: A review of the past, present, and future (Q6087068) (← links)