Notice: Unexpected clearActionName after getActionName already called in /var/www/html/includes/context/RequestContext.php on line 339
José María Sanchis - MaRDI portal

José María Sanchis

From MaRDI portal
(Redirected from Person:1296788)
Person:185371

Available identifiers

zbMath Open sanchis.jose-mariaMaRDI QIDQ185371

List of research outcomes

PublicationDate of PublicationType
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
Darboux Sums and the Sum of the Alternating Harmonic Series2019-02-18Paper
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/Q52714512017-07-11Paper
https://portal.mardi4nfdi.de/entity/Q52714532017-07-11Paper
https://portal.mardi4nfdi.de/entity/Q52714582017-07-11Paper
A branch-and-cut algorithm for the profitable windy rural postman problem2016-10-07Paper
A branch-price-and-cut algorithm for the min-maxk-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
A metaheuristic for the min-max windy rural postman problem with K vehicles2010-09-20Paper
New Results on the Mixed General Routing Problem2009-07-18Paper
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra2009-05-27Paper
An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation2008-04-24Paper
A branch & cut algorithm for the windy general routing problem and special cases2007-07-30Paper
Lower bounds and heuristics for the windy rural postman problem2006-11-15Paper
A comparison of two different formulations for arc routing problems on mixed graphs2006-06-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
A heuristic algorithm based on Monte Carlo methods for the rural postman problem.2003-09-07Paper
The mixed general routing polyhedron2003-07-13Paper
A GRASP heuristic for the mixed Chinese postman problem2002-11-17Paper
A cutting plane algorithm for the general routing problem2002-08-07Paper
A real delivery problem dealt with Monte Carlo techniques2001-10-04Paper
https://portal.mardi4nfdi.de/entity/Q47624682001-02-22Paper
The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra1999-11-14Paper
A polyhedral approach to the rural postman problem1995-01-11Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: José María Sanchis