Sanchis J.M.

J.M. Sanchis

Information about the author J.M. Sanchis will soon be added to the site.
Found 7 papers in total
The mixed general routing polyhedron
The mixed general routing polyhedron
2003
In Arc Routing Problem, ARPs, the aim is to find on a graph a minimum cost traversal...
A greedy randomized adaptive search procedure heuristic for the mixed Chinese postman problem
A greedy randomized adaptive search procedure heuristic for the mixed Chinese postman problem
2002
Arc routing problems consist of finding a traversal on a graph satisfying some...
A cutting plane algorithm for the general routing problem
A cutting plane algorithm for the general routing problem
2001
The General Routing Problem (GRP) is the problem of finding a minimum cost route for a...
A real delivery problem dealt with Monte Carlo techniques
A real delivery problem dealt with Monte Carlo techniques
2000
In this paper we use Monte Carlo techniques to deal with a real world delivery problem...
The General Routing Problem polyhedron: Facets from the Rural Postman Problem and Graphical Traveling Salesman Problem polyhedra
The General Routing Problem polyhedron: Facets from the Rural Postman Problem and Graphical Traveling Salesman Problem polyhedra
1998
In this paper we study the polyhedron associated with the General Routing Problem...
A heuristic algorithm based on Monte Carlo methods for the rural postman problem
A heuristic algorithm based on Monte Carlo methods for the rural postman problem
1998
The Rural Postman Problem (RPP) consists of finding a minimum cost traversal of a...
A polyhedral approach to the rural postman problem
A polyhedral approach to the rural postman problem
1994
In this paper we study the polyhedron associated with the Rural Postman Problem (RPP)....
Papers per page: