Isaac Plana

Orcid: 0000-0002-0516-4608

According to our database1, Isaac Plana authored at least 34 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Theoretical and computational analysis of a new formulation for the Rural Postman Problem and the General Routing Problem.
Comput. Oper. Res., February, 2024

2023
The multi-purpose <i>K</i>-drones general routing problem.
Networks, December, 2023

Upgrading edges in the Graphical TSP.
Comput. Oper. Res., November, 2023

2022
The min-max close-enough arc routing problem.
Eur. J. Oper. Res., 2022

The Profitable Close-Enough Arc Routing Problem.
Comput. Oper. Res., 2022

Polyhedral analysis and a new algorithm for the length constrained K-drones rural postman problem.
Comput. Optim. Appl., 2022

2021
Arc routing problems: A review of the past, present, and future.
Networks, 2021

On the Distance-Constrained Close Enough Arc Routing Problem.
Eur. J. Oper. Res., 2021

Solving the length constrained K-drones rural postman problem.
Eur. J. Oper. Res., 2021

2019
Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm.
Discret. Appl. Math., 2019

2018
The Chinese Postman Problem with Load-Dependent Costs.
Transp. Sci., 2018

Drone arc routing problems.
Networks, 2018

2017
The Hierarchical Mixed Rural Postman Problem.
Transp. Sci., 2017

Aesthetic considerations for the min-max K-Windy Rural Postman Problem.
Networks, 2017

The directed profitable rural postman problem with incompatibility constraints.
Eur. J. Oper. Res., 2017

The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm.
Eur. J. Oper. Res., 2017

Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem.
EURO J. Comput. Optim., 2017

2016
A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem.
Transp. Sci., 2016

A branch-and-cut algorithm for the profitable windy rural postman problem.
Eur. J. Oper. Res., 2016

A branch-and-cut algorithm for the Orienteering Arc Routing Problem.
Comput. Oper. Res., 2016

2015
The stacker crane problem and the directed general routing problem.
Networks, 2015

A matheuristic for the Team Orienteering Arc Routing Problem.
Eur. J. Oper. Res., 2015

2014
The Team Orienteering Arc Routing Problem.
Transp. Sci., 2014

A branch-price-and-cut algorithm for the min-max <i>k</i>-vehicle windy rural postman problem.
Networks, 2014

2013
A branch-and-cut algorithm for the maximum benefit Chinese postman problem.
Math. Program., 2013

2012
New results on the Windy Postman Problem.
Math. Program., 2012

An ILS-Based Metaheuristic for the Stacker Crane Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2012

2011
New facets and an enhanced branch-and-cut for the min-max <i>K</i>-vehicles windy rural postman problem.
Networks, 2011

2009
Min-Max <i>K</i>-vehicles windy rural postman problem.
Networks, 2009

2008
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra.
SIAM J. Discret. Math., 2008

2007
A branch & cut algorithm for the windy general routing problem and special cases.
Networks, 2007

2006
Zigzag inequalities: a new class of facet-inducing inequalities for Arc Routing Problems.
Math. Program., 2006

2005
New heuristic algorithms for the windy rural postman problem.
Comput. Oper. Res., 2005

2004
GRASP and path relinking for the matrix bandwidth minimization.
Eur. J. Oper. Res., 2004


  Loading...