Jose Maria Sanchis

About Jose Maria Sanchis

Jose Maria Sanchis, With an exceptional h-index of 27 and a recent h-index of 15 (since 2020), a distinguished researcher at Universidad Politécnica de València, specializes in the field of Optimización combinatoria.

His recent articles reflect a diverse array of research interests and contributions to the field:

Theoretical and computational analysis of a new formulation for the Rural Postman Problem and the General Routing Problem

The multi‐purpose K‐drones general routing problem

Upgrading edges in the Graphical TSP

The Min Max Multi-Trip Location Arc Routing Problem

Basalt FRP rods assessment as an alternative reinforcement for reinforced concrete

Polyhedral analysis and a new algorithm for the length constrained K–drones rural postman problem

The min-max close-enough arc routing problem

The profitable close-enough arc routing problem

Jose Maria Sanchis Information

University

Position

Profesor de Matemáticas

Citations(all)

1761

Citations(since 2020)

670

Cited By

1310

hIndex(all)

27

hIndex(since 2020)

15

i10Index(all)

43

i10Index(since 2020)

23

Email

University Profile Page

Google Scholar

Jose Maria Sanchis Skills & Research Interests

Optimización combinatoria

Top articles of Jose Maria Sanchis

Title

Journal

Author(s)

Publication Date

Theoretical and computational analysis of a new formulation for the Rural Postman Problem and the General Routing Problem

Computers & Operations Research

Ángel Corberán

Isaac Plana

José M Sanchis

Paula Segura

2024/2/1

The multi‐purpose K‐drones general routing problem

Networks

James Campbell

Ángel Corberán

Isaac Plana

José M Sanchis

Paula Segura

2023/12

Upgrading edges in the Graphical TSP

Computers & Operations Research

Mercedes Landete

Isaac Plana

José Luis Sainz-Pardo

José María Sanchis

2023/11/1

The Min Max Multi-Trip Location Arc Routing Problem

XII International Workshop on Locational Analysis and Related Problems

Teresa Corberán

Isaac Plana

José María Sanchis

2023/9/7

Basalt FRP rods assessment as an alternative reinforcement for reinforced concrete

José María Vercher Sanchis

Tomàs Vidal

Javier Torres

Carlos Lerma Elvira

Júlia G Borràs

...

2023/5/22

Polyhedral analysis and a new algorithm for the length constrained K–drones rural postman problem

Computational Optimization and Applications

James Campbell

Ángel Corberán

Isaac Plana

José M Sanchis

Paula Segura

2022/9

The min-max close-enough arc routing problem

European Journal of Operational Research

Nicola Bianchessi

Ángel Corberán

Isaac Plana

Miguel Reula

José M Sanchis

2022/8/1

The profitable close-enough arc routing problem

Computers & Operations Research

Nicola Bianchessi

Ángel Corberán

Isaac Plana

Miguel Reula

José M Sanchis

2022/4/1

On the distance-constrained close enough arc routing problem

European Journal of Operational Research

Ángel Corberán

Isaac Plana

Miguel Reula

José M Sanchis

2021/5/16

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

Angel Corberán

Richard Eglese

Geir Hasle

Isaac Plana

José María Sanchis

2021/1

Polyhedral study of a new formulation for the Rural Postman Problem

Á Corberán

Isaac Plana

José M Sanchis

Paula Segura

2021/7/15

Solving the length constrained K-drones rural postman problem

European Journal of Operational Research

James F Campbell

Ángel Corberán

Isaac Plana

José M Sanchis

Paula Segura

2021/7/1

Distance-Constrained Close Enough Arc Routing Problem: Polyhedral study and B&C algorithm

X International Workshop on Locational Analysis and Related Problems

Ángel Corberán

Isaac Plana

Miguel Reula

José María Sanchis

2020/1/23

See List of Professors in Jose Maria Sanchis University(Universidad Politécnica de València)

Co-Authors

academic-engine