Call for Papers

PAREO '2002
Third meeting of the PAREO Euro working group on  Parallel Processing in Operations Research

Marissol Novotel Hotel Guadeloupe, France, May 20-24 2002

Menu

Presentation

General Information

Important Dates

Program

Registration


PAREO Home page


Email contact:
pareo2002@prism.uvsq.fr


Presentation

The use of parallel computers leads to substantial time savings, and even makes it possible to solve larger problems than before. However, the effort required to harness the potential power of parallel computers should not be underestimated.

Within the Association of European Operational Research Societies EURO, the working group PAREO brings together researchers from both academia and industry who are interested in the development of parallel algorithms for problems in the area of operations research. Its objective is to bridge the gap between the two complementary disciplines of Operations Research and High Performance Computing.

PAREO'2002 will be the third meeting organized by the PAREO working group. It intends to be the meeting place for researchers from all over the world, actively involved in the development and the application of parallel computing methodologies for discrete and continuous optimization. Through presentations and open discussions, the meeting aims to promote the exchange of recent results, to review successes and setbacks, to identify promising research directions and application domains, and to foster new collaborations. Furthermore, the program should give ample opportunity for informal discussions.


Related Topics

The program will consist of invited lectures, discussions, and contributed presentations, and contributed 30-minute presentations, with no parallel sessions. Presentations will cover recent developments related to the main areas on the edge of parallel computing and operations research. Topics of interest include (but are not limited to):
  • Exact and approximate parallel methods

  • for continuous and discrete optimization problems
    - simplex and interior point methods
    - nonlinear programming
    - stochastic programming
    - dynamic programming
    - branch and bound
    - local search
    - tabu search
    - genetic algorithms
    - simulated annealing
    - hybrid methods
    - ...
  • Software tools

  • - load balancing methods
    - parallelization strategies
    - libraries
    - ...
  • Applications

  • - crew scheduling
    - vehicle routing
    - quadratic assignment
    - sequencing and scheduling
    - ...