(Message inbox:28) Date: Tue, 17 Dec 1996 15:26:22 PST To: Local Distribution From: Afonso ferreira Subject: CFP - SCOOP Return-Path: X-Sun-Charset: US-ASCII Approved-By: Doug Ierardi Approved-By: Theory-A - TheoryNet World-Wide Events Reply-To: Theory-A - TheoryNet World-Wide Events , Afonso ferreira Sender: TheoryNet List Comments: To: THEORY-A@LISTSERV.NODAK.EDU ********************************************************* * * * This message has been sent to a diffusion list. * * We apologize if you receive it more than once. * * * ********************************************************* C A L L F O R P A P E R S _____________________________ WORKSHOP ON SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS IN PARALLEL --- SCOOP --- April 5, 1997 - Geneva, Switzerland To be held in conjunction with IPPS'97 Deadline for submission: January 10, 1997 (http://www.ens-lyon.fr/LIP/SCOOP) The solution of optimization problems in real world applications usually involves an enormous amount of work in which the use of parallel computers may be of great value. Through parallel computing, not only problems may be solved faster, but also large-sized problems may become tractable. The SCOOP workshop is aimed to bring together experts in the field of parallel combinatorial computing. It will address both exact and approximate methods for scientific and practical hard optimization problems. The workshop will be the final meeting of the Human Capital and Mobility project SCOOP of the European Union. It will be held on the last day of the IPPS symposium (April 1--5, 1997), in Geneva, Switzerland. The program will consist of a key-note lecture, and a number of short (25 minute) contributed presentations. The key-note lecture will be the following. ----------------------------------------------------------------- Stavros A. Zenios School of Economics and Management University of Cyprus High Performance Computing for Financial Applications ----------------------------------------------------------------- Abstracts are solicited reporting research in combinatorial optimization in parallel. The following are topics of interest (list not exclusive): - Applications - Approximation Algorithms - Branch and Bound - Continuous optimization - Dynamic programming - Financial Applications - Graph Partitioning - Libraries - Load Balancing - Metaheuristics - Network Design - Quadratic Assignment Problems - Randomized Algorithms - Scheduling - Tools - Vehicle Routing Problems - Others Program Committee ----------------- A. Ferreira (Chair) -- Lyon A. de Bruin -- Rotterdam J. Clausen -- Copenhagen P. Crescenzi -- Rome J. Eckstein -- New Jersey M. Gengler -- Lyon G. Megson -- Reading V. Kumar -- Minnesota S. Migdalas -- Linkoping B. Monien -- Paderborn P. Panagiotopoulos -- Thessaloniki P. Pardalos -- Florida J. Rolim -- Geneva C. Roucairol -- Versailles Organizing Committee -------------------- G. Kindervater (Chair) -- Rotterdam P. Rebreyend -- Lyon S. Ubeda -- Lyon Contributions may be submitted by sending a one-page abstract by email to scoop-ipps@cs.few.eur.nl. The abstract may be either plain ASCII text or in LaTex format. The deadline for submissions is January 10, 1997. Notification will be before February 10,1997. The final version of the papers presented at the Workshop will be considered for publication in a Special Issue of the electronic journal Parallel Algorithms and Architectures, published by International Thompson Publishers, to appear in December 1997. For further information please contact Gerard Kindervater Department of Computer Science Erasmus University P.O. BOX 1738 3000 DR Rotterdam The Netherlands email: gapk@cs.few.eur.nl FAX: + 31 10 4526177 VOX: + 31 10 4081316