Isaac Plana

From MaRDI portal
Person:321106

Available identifiers

zbMath Open plana.isaacMaRDI QIDQ321106

List of research outcomes





PublicationDate of PublicationType
Theoretical and computational analysis of a new formulation for the rural postman problem and the general routing problem2024-06-06Paper
Aesthetic considerations for the min-max \(K\)-windy rural postman problem2024-05-03Paper
The multi‐purpose K‐drones general routing problem2024-01-18Paper
Arc routing problems: A review of the past, present, and future2023-12-11Paper
Upgrading edges in the graphical TSP2023-09-13Paper
Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem2022-08-08Paper
The min-max close-enough arc routing problem2022-03-18Paper
The profitable close-enough arc routing problem2022-03-09Paper
Solving the length constrained \(K\)-drones rural postman problem2021-06-07Paper
On the distance-constrained close enough arc routing problem2021-06-04Paper
A matheuristic for the distance-constrained close-enough arc routing problem2019-07-11Paper
Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm2019-05-17Paper
The directed profitable rural postman problem with incompatibility constraints2018-05-29Paper
The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm2018-05-24Paper
The stacker crane problem and the directed general routing problem2018-05-23Paper
Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem2018-03-28Paper
https://portal.mardi4nfdi.de/entity/Q52714532017-07-11Paper
https://portal.mardi4nfdi.de/entity/Q52714582017-07-11Paper
https://portal.mardi4nfdi.de/entity/Q52714512017-07-11Paper
A branch-and-cut algorithm for the orienteering arc routing problem2016-11-17Paper
A branch-and-cut algorithm for the profitable windy rural postman problem2016-10-07Paper
A matheuristic for the team orienteering arc routing problem2016-10-06Paper
A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem2016-06-10Paper
A branch-and-cut algorithm for the maximum benefit Chinese postman problem2013-11-11Paper
An ILS-Based Metaheuristic for the Stacker Crane Problem2012-10-18Paper
New results on the windy postman problem2012-04-27Paper
New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem2012-01-18Paper
Min-Max K -vehicles windy rural postman problem2010-11-24Paper
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra2009-05-27Paper
A branch & cut algorithm for the windy general routing problem and special cases2007-07-30Paper
Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems2006-06-28Paper
New heuristic algorithms for the windy rural postman problem2005-09-02Paper
GRASP and path relinking for the matrix bandwidth minimization.2004-01-05Paper

Research outcomes over time

This page was built for person: Isaac Plana