The following pages link to Isaac Plana (Q321106):
Displaying 31 items.
- A branch-and-cut algorithm for the profitable windy rural postman problem (Q321108) (← links)
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem (Q378087) (← links)
- GRASP and path relinking for the matrix bandwidth minimization. (Q1417505) (← links)
- Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem (Q1707079) (← links)
- The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm (Q1752763) (← links)
- The directed profitable rural postman problem with incompatibility constraints (Q1753601) (← links)
- A matheuristic for the distance-constrained close-enough arc routing problem (Q2001874) (← links)
- On the distance-constrained close enough arc routing problem (Q2029943) (← links)
- Solving the length constrained \(K\)-drones rural postman problem (Q2030543) (← links)
- The min-max close-enough arc routing problem (Q2116901) (← links)
- Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem (Q2162526) (← links)
- New heuristic algorithms for the windy rural postman problem (Q2387296) (← 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)
- Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems (Q2494509) (← links)
- The profitable close-enough arc routing problem (Q2669779) (← links)
- A branch-price-and-cut algorithm for the min-max<i>k</i>-vehicle windy rural postman problem (Q2811322) (← links)
- Min-Max <i>K</i> -vehicles windy rural postman problem (Q3057121) (← links)
- New facets and an enhanced branch-and-cut for the min-max <i>K</i> -vehicles windy rural postman problem (Q3113511) (← links)
- An ILS-Based Metaheuristic for the Stacker Crane Problem (Q3164900) (← links)
- The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra (Q3629465) (← links)
- The stacker crane problem and the directed general routing problem (Q4642462) (← links)
- (Q5271451) (← links)
- (Q5271453) (← links)
- (Q5271458) (← links)
- A branch & cut algorithm for the windy general routing problem and special cases (Q5295483) (← links)
- Upgrading edges in the graphical TSP (Q6047867) (← links)
- Arc routing problems: A review of the past, present, and future (Q6087068) (← links)
- The multi‐purpose <i>K</i>‐drones general routing problem (Q6180030) (← links)
- Aesthetic considerations for the min-max \(K\)-windy rural postman problem (Q6496353) (← links)
- Theoretical and computational analysis of a new formulation for the rural postman problem and the general routing problem (Q6551080) (← links)
