The following pages link to Ángel Corberán (Q185369):
Displaying 50 items.
- A matheuristic for the team orienteering arc routing problem (Q319589) (← links)
- (Q321105) (redirect page) (← links)
- A branch-and-cut algorithm for the profitable windy rural postman problem (Q321108) (← links)
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem (Q336883) (← links)
- Scatter search for an uncapacitated \(p\)-hub median problem (Q337508) (← links)
- A branch-and-cut algorithm for the orienteering arc routing problem (Q342166) (← links)
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem (Q378087) (← links)
- Lower bounds and heuristics for the windy rural postman problem (Q852946) (← links)
- A metaheuristic for the min-max windy rural postman problem with K vehicles (Q993701) (← links)
- (Q1176819) (redirect page) (← links)
- Polyhedral results for a vehicle routing problem (Q1176821) (← links)
- (Q1296787) (redirect page) (← links)
- The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra (Q1296789) (← links)
- A polyhedral approach to the rural postman problem (Q1342042) (← links)
- The mixed general routing polyhedron (Q1396827) (← links)
- Separating capacity constraints in the CVRP using tabu search (Q1609917) (← links)
- Heuristics for the capacitated modular hub location problem (Q1652383) (← links)
- Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem (Q1707079) (← links)
- The periodic rural postman problem with irregular services on mixed graphs (Q1734335) (← 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 GRASP heuristic for the mixed Chinese postman problem (Q1847247) (← links)
- Heuristics for the mixed rural postman problem (Q1968592) (← 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)
- Profitable mixed capacitated arc routing and related problems (Q2343077) (← links)
- New heuristic algorithms for the windy rural postman problem (Q2387296) (← 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)
- A comparison of two different formulations for arc routing problems on mixed graphs (Q2496040) (← links)
- The profitable close-enough arc routing problem (Q2669779) (← links)
- A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem (Q2811322) (← links)
- (Q2968985) (← 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)
- An ILS-Based Metaheuristic for the Stacker Crane Problem (Q3164900) (← links)
- (Q3337973) (← links)
- The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra (Q3629465) (← links)
- An algorithm for the Rural Postman problem on a directed graph (Q3730368) (← links)
- The Capacitated Arc Routing Problem: Lower bounds (Q4022732) (← links)
- The stacker crane problem and the directed general routing problem (Q4642462) (← links)
- (Q4656643) (← links)
- (Q4762468) (← links)
- Arc Routing (Q5256774) (← links)
- (Q5271448) (← links)
- (Q5271451) (← links)
