Pages that link to "Item:Q5295483"
From MaRDI portal
The following pages link to A branch & cut algorithm for the windy general routing problem and special cases (Q5295483):
Displaying 24 items.
- Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
- A branch-and-cut algorithm for the profitable windy rural postman problem (Q321108) (← links)
- \(p\)-facility Huff location problem on networks (Q323476) (← links)
- Modeling and solving the mixed capacitated general routing problem (Q375984) (← links)
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem (Q378087) (← links)
- Single-facility huff location problems on networks (Q490213) (← links)
- A metaheuristic for the min-max windy rural postman problem with K vehicles (Q993701) (← links)
- Solving the prize-collecting rural postman problem (Q1041930) (← links)
- A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows (Q1651548) (← links)
- The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm (Q1752763) (← links)
- A matheuristic for the distance-constrained close-enough arc routing problem (Q2001874) (← links)
- Solving the length constrained \(K\)-drones rural postman problem (Q2030543) (← links)
- Integer programming formulation and polyhedral results for windy collaborative arc routing problem (Q2146988) (← links)
- Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem (Q2162526) (← links)
- Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm (Q2414451) (← links)
- New results on the windy postman problem (Q2429464) (← links)
- Solving the median problem with continuous demand on a network (Q2636614) (← links)
- Min-Max <i>K</i> -vehicles windy rural postman problem (Q3057121) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- New facets and an enhanced branch-and-cut for the min-max <i>K</i> -vehicles windy rural postman problem (Q3113511) (← links)
- Plowing with precedence in polynomial time (Q6092637) (← links)
- On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
- Improving a constructive heuristic for the general routing problem (Q6179705) (← links)
- The multi‐purpose <i>K</i>‐drones general routing problem (Q6180030) (← links)