José Luis E. Dos Santos

According to our database, José Luis E. Dos Santos authored at least 8 papers between 1997 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2020

Commutation Classes of the Reduced Words for the Longest Element of S_n.

Gonçalo Gutierres, Ricardo Mamede, José Luis Esteves dos Santos

Electron. J. Comb., 2020

2019

Optimal Gray code for involutions.

Gonçalo Gutierres, Ricardo Mamede, José Luis Esteves dos Santos

Inf. Process. Lett., 2019

2018

Gray codes for signed involutions.

Gonçalo Gutierres, Ricardo Mamede, José Luis Esteves dos Santos

Discret. Math., 2018

A new approach for the multiobjective minimum spanning tree.

José Luis Esteves dos Santos, Luigi Di Puglia Pugliese, Francesca Guerriero

Comput. Oper. Res., 2018

2015

Dynamic programming for spanning tree problems: application to the multi-objective case.

Luigi Di Puglia Pugliese, Francesca Guerriero, José Luis Esteves dos Santos

Optim. Lett., 2015

2003

The determination of the path with minimum-cost norm value.

José M. P. Paixão, Ernesto de Queirós Vieira Martins, Mário S. Rosa, José Luis E. Dos Santos

Networks, 2003

1999

Deviation Algorithms for Ranking Shortest Paths.

Ernesto de Queirós Vieira Martins, Marta M. B. Pascoal, José Luis E. Dos Santos

Int. J. Found. Comput. Sci., 1999

1997

An algorithm for the quickest path problem.

Ernesto de Queirós Vieira Martins, José Luis Esteves dos Santos

Oper. Res. Lett., 1997