Edo S. Van der Poort

According to our database, Edo S. Van der Poort authored at least 3 papers between 1998 and 2000.

Collaborative distances:

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

2000

The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges.

Ruud H. Teunter, Edo S. Van der Poort

Oper. Res. Lett., 2000

1999

Solving the <i>k</i>-best traveling salesman problem.

Edo S. Van der Poort, Marek Libura, Gerard Sierksma, Jack A. A. van der Veen

Comput. Oper. Res., 1999

1998

Stability Aspects of the Traveling Salesman Problem Based on K-best Solutions.

Marek Libura, Edo S. Van der Poort, Gerard Sierksma, Jack A. A. van der Veen

Discret. Appl. Math., 1998