From - Tue Dec 2 01:46:36 1997 Received: from CS.Stanford.EDU (CS.Stanford.EDU [171.64.64.64]) by robotics.Stanford.EDU (8.8.7/8.8.7) with ESMTP id GAA21146; Fri, 7 Nov 1997 06:23:25 -0800 (PST) Received: from listserv-mail.surfnet.nl (listserv-mail.surfnet.nl [192.87.5.141]) by CS.Stanford.EDU (8.8.7/8.8.7) with ESMTP id GAA07434; Fri, 7 Nov 1997 06:24:02 -0800 (PST) Received: from listserv-mail (192.87.5.141) by listserv-mail.surfnet.nl (LSMTP for Windows NT v1.1a) with SMTP id <0.734C00B0@listserv-mail.surfnet.nl>; Fri, 7 Nov 1997 15:18:50 +0100 Received: from NIC.SURFNET.NL by NIC.SURFNET.NL (LISTSERV-TCP/IP release 1.8c) with spool id 0471 for DMA-LIST@NIC.SURFNET.NL; Fri, 7 Nov 1997 15:24:16 +0100 Received: from HEARN (NJE origin SMTP@HEARN) by HEARN.NIC.SURFNET.NL (LMail V1.2c/1.8c) with BSMTP id 1794; Fri, 7 Nov 1997 15:24:15 +0100 Received: from utmfu6.math.utwente.nl by HEARN.nic.SURFnet.nl (IBM VM SMTP V2R2) with TCP; Fri, 07 Nov 97 15:24:14 +0100 Received: from utmfu0.math.utwente.nl (utmou1.math.utwente.nl) by utmfu6.math.utwente.nl with ESMTP (1.40.112.8/16.2) id AA070372577; Fri, 7 Nov 1997 15:22:58 +0100 Received: by utmfu0.math.utwente.nl ($Revision: 1.36.108.11 $/16.2) id AA188342575; Fri, 7 Nov 1997 15:22:55 +0100 Mailer: Elm [revision: 66.36.1.1] Approved-By: DMANET Message-ID: <199711071422.AA188342575@utmfu0.math.utwente.nl> Date: Fri, 7 Nov 1997 15:22:53 MET Reply-To: jc@serv2.imm.dtu.dk Sender: DMANET From: DMANET Subject: CfP: SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS IN PARALLEL To: DMA-LIST@NIC.SURFNET.NL Status: RO X-Status: ********************************************************* * * * 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 _____________________________ SECOND WORKSHOP ON SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS IN PARALLEL --- SCOOP --- April 3, 1998 - Orlando, Florida To be held in conjunction with IPPS/SPDP'98 Deadline for submission: December 15, 1997 __________ http://www.imm.dtu.dk/~orgroup/SCOOP-Workshop.html Scope ----- 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. Parallel computing facilitates that problems may be solved faster, that large-sized problems may become tractable, and that development of solution methods also for large-scale problems can be based on an interplay between theory and experimentation. The SCOOP workshop aims 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 be held on the last day of the IPPS/SPDP'98 symposium (March 30 -- April 3, 19978, in Orlando, Florida. Program ------- The program will consist of two key-note lectures, and a number of short (25 minute) contributed presentations. The key-note lectures are: ----------------------------------------------------------------- Computing Constrained Minimum Spanning Trees in Parallel by Narsingh Deo Director, Center for Parallel Computation Department of Computer Science University of Central Florida Orlando, Florida and Exhaustive Search and Combinatorial Optimization: Exploring the Power of Parallel Computing by Jurg Nievergelt Professor, Department of Computer Science ETH Zurich Switzerland ----------------------------------------------------------------- Contributions 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 Program Committee ----------------- The following have agreed to serve on the committee. Additional members are expected. J. Clausen -- Copenhagen (Chair) R. Correa -- Rio de Janeiro A. de Bruin -- Rotterdam N. Deo -- Florida A. Ferreira -- Sophia Antipolis M. Gengler -- Lyon A. Grama -- Purdue G. Kindervater -- Rotterdam B. le Cun -- Versailles R. Lueling -- Paderborn G. Megson -- Reading S. Migdalas -- Linkoping J. Nievergelt -- Zurich P. Pardalos -- Florida M. Resende -- AT & T J. Rolim -- Geneva S. Tschoeke -- Paderborn A. Zomaya -- Western Australia Organizing Committee -------------------- P. Pardalos -- Florida (Chair) J.Clausen Submission and proceedings --------------------------- Springer Verlag has agreed to publish a volume in the LNCS series containing proceedings from a number of the workshops held in connection with IPPS/SPDP. Contributions to be considered for publication in this volume must be submitted as full papers, and in order for the proceedings to be available at the workshop, the deadlines indicated are strict. In addition to full papers to be considered for the proceedings, also one-page abstracts of talks are welcomed. All submission must be sent by e-mail to jc@imm.dtu.dk. Abstract may be either plain ASCII text or in LaTex format, whereas full papers must be submitted as postscript files. The deadline for submission is December 15, 1997. Notification of acceptance both with respect to presentation at the workshop and publication in the proceedings will be before January 5, 1998. The final camera-ready versions of the papers accepted for the proceedings must comply with the Springer LCNS style and must be received before January 20, 1998. For further information please contact Professor Jens Clausen Department of Mathematical Modelling Technical University of Denmark DK 2800 Lyngby Denmark e-mail: jc@imm.dtu.dk Phone: +45 45 25 33 87 Fax: +45 45 88 26 73 -- ****************************************************** Contributions to be spread via DMANET are submitted to DMANET@math.utwente.nl Replies to a message carried on DMANET should NOT be addressed to DMANET but to the original sender. The original sender, however, is invited to prepare an update of the replies received and to communicate it via DMANET. DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)