From dmanet@math.utwente.nl Thu Apr 15 13:11:42 1999 Date: Thu, 15 Apr 1999 17:01:32 +0200 From: Discrete Mathematics and Algorithms Network Reply-To: ecco99@lim.univ-mrs.fr To: DMA-LIST@NIC.SURFNET.NL Subject: ECC0-12: CFParticipation+Preliminary Program ============================================================================= ECCO-12 THE 12th MEETING OF THE EUROPEAN CHAPTER ON COMBINATORIAL OPTIMIZATION May 27-29, 1999 Island of Bendor, Bandol, FRANCE ============================================================================= Program Wednesday, May 26 1999 Registration, Reception Thursday, May 27 1998 Invited Lecture: Thomas Liebling I. Vehicle Routing I II. Scheduling I Invited Lecture: Andras Frank III. Scheduling II IV. Networks V. Combinatorial Optimization I VI. Polyhedral Approach Friday, May 28 1998 Invited Lecture: Jacek Blazewicz VII. Heuristic I VIII. Graphs IX. Scheduling III X. Vehicle Routing II Evening: Conference Dinner Saturday, May 29 1998 Invited Lecture: Michel Goemans XI. Mathematical Programming XII. Combinatorial Optimization II XIII. TSP XIV. Heuristic II Thursday, May 27 8:45-9:15 Registration 9:15-9:30 Opening 9:30-10:30 Thomas Liebling ``...'' 10:30-11:00 Coffee 11:00-12:30 I. Vehicle Routing I - Enrico Angelelli, Maria Grazia Speranza Periodic Routing Model with Renewable Capacity Applied to Differentiate Waste Collection - B. Le Cun, B. Lemarié, R. Mechti, C. Roucairol An exact method to solve Vehicle Routing Problem with capacity and time window constraints - Oli B.G. Madsen Vehicle routing problems with time windows: speeding up the separation algorithm for 2-path cuts and the column generation II. Scheduling I - Gerd Finke Scheduling with compatibility graphs - Joanna Jozefowska, Marek Mika, Jan Weglarz Makespan minimization on two machines with an additional continucous resource - Renata Mansini, Maria Grazia Speranza, Zsolt Tuza Scheduling tasks with precedence constraints on three dedicated processors 12:30-14:00 Lunch 14:00-15:00 Andras Frank Connectivity And Submodularity: Problems and Results 15:00-17:00 III. Scheduling II - Joanna Jozefowska, Rafal Rozycki, Jan Weglarz Solving a scheduling problem using parallel Genetic Algorithms with multiple selection schemes - J. Blazewicz, P. Formanowicz, F. Guinand, M. Kasprzak A Parallel Approximation Algorithm for DNA-Sequencing - Vitaly A. Strusevich Job shop scheduling: problems with batching - B. Penz, C. Rapine, D. Trystram Sensitivity Analysis on a Flow-Shop Problem IV. Networks - Hartmut Noltemeier Constrained flow improvement - S. Bertrand, F. Boyer, P. Chanas, A. Laugier and J.-P. Paris Routing Heterogeneous Traffic on Heterogeneous Networks - Victor Chepoi, Yann Vaxčs Connectivity augmentation under diameter constraints 17:00-17:30 Coffee 17:30-19:30 V. Combinatorial Optimization I - Sacha Varone Tree metrics - Hervé Thiriez Combinatorial problem solving with spreadsheet add-ins - David Azulay None of the current implementations of LU factorization maintain integer coefficients - Lucia Bertazzi, Maria Grazia Speranza Approximation Algorithms for the Minimization of the Transportation and Inventory Costs VI. Polyhedral Approach - Ridha Mahjoub Critical extreme points of 2-connected polyhedra - Alexandre Laugier A Polyhedral Cutting Plane Algorithm Using Matrix Cuts - Samuel Fiorini Automorphism Groups of Some ``Order Polytopes'' - Martine Labbé, Gilbert Laporte, Inmaculada Rodríguez Martín, Juan José Salazar González Solving two Median Cycle Problems through Branch-and-Cut Friday, May 28 9:00-10:00 Jacek Blazewicz and Daniel Kobler On the ties between graph representations in scheduling and sequencing 10:00-10:30 Coffee 10:30-12:30 VII. Heuristics I - Eric Angel, Vassilis Zissimopoulos On exact neighborhoods for local search algorithms - J. Houdayer, O.C. Martin Engineering Children in Genetic Algorithms - Thierry Mautor Intensification strategies for the local search methods - Thomas Stützle, Holger Hoos Exploiting the Run-time Behavior of Local Search VIII. Graphs - Alain Hertz, Mike Gerber, Pierre Hansen Extension of Turán's Theorem to the 2-Stability Number - Dominique de Werra, Christine Eisenbeis, Sylvain Lelait, Elena Stöhr Circular-arc Graph Coloring: on Chords and Circuits in the Meeting Graph - Abdallah Zemirline Quasi-star-cutset and gem-free graphs - Olivier Hudry A branch and bound method for the clique partitioning of a graph 12:30-18:00 Excursion. 18:00-19:30 IX. Scheduling III - Klaus Ecker Repeated Execution of Non-Preemptive Tasks with Relative Timing Constraints - Yves Denneulin Granularity and on-line scheduling of Branch&Bound tasks - Wieslaw Kubiak Optimal Just-In-Time Sequences Are Cyclic X. Vehicle Routing II - Catherine Roucairol, Moshe Dror, Dominique Fortin Eulerian trail in pickup and delivery problems - O. Eriksen, R. Lorentzen, H. Moseby AMMONET - a novel approach to the inventory pickup and delivery - Matteo Fischetti, Andrea Lodi, Paolo Toth A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem 19:30 Conference dinner Saturday, May 29 9:00-10:00 Michel Goemans ``LP relaxations arising from cooperative game theory'' 10:00-10:30 Coffee 10:30-12:30 XI. Mathematical Programming - Van-Dat Cung, Frédéric Roupin A Parallel Branch-and-Bound Algorithm using a Semidefinite Programming Relaxation for the Vertex-Cover Problem - Fred Glover The scope and implications of unconstrained 0-1 quadratic programming - Marc El-Bčze, Philippe Michelon An Integer Programming Approach to Word Sense Disambiguation - Olivier Briant, Denis Naddef The diversity management problem: a lagrangian relaxation approach XII. Combinatorial Optimization II - Michel Gendreau, Srimathy Gopalakrishnan and Jean-Marc Rousseau Heuristics for the Stochastic Eulerian Tour Problem - Paolo Toth, Alberto Caprara and Matteo Fischetti Algorithms for the set covering problem - Federico Della Croce, Marc Demange, Roberto Tadei On compacting test sequences for sequential circuits: a practical application of the set covering problem - Gerard Plateau, Patrick Boucher, Idri Gouachi Metaheuristics and surrogate relaxation in our system LIRESNE for solving integer satisfaction constraint problems 12:30-14:00 Lunch 14:00-16:00 XIII. TSP - Philippe Preux, Denis Robilliard and Cyril Fonlupt Simplicity can meet efficiency -- The case of the TSP - Gilbert Laporte, Jorge Riera-Ledesma and Juan-José Salazar-González The Traveling Purchaser Problem - Maud Göthe-Lundgren, Torbjörn Larsson and Andreas Westerlund The Traveling Salesman Subtour Problem - A Strong Formulation, Relaxations and Branch-and-Bound - Nguyen Viet Hung and Jean-François Maurras Lifting Algorithm for the circuit polytope and the CCCP polytope XIV. Heuristics II - David L. Woodruff, Fred Glover, Arne Lřkketangen Scatter Search to Generate Diverse MIP Solutions - Joanna Jozefowska, Grzegorz Waligora, Jan Weglarz Tabu list management methods for a scheduling problem under an additional continuous resource - Philippe Preux, David Duvivier Creating gradient to help local search algorithm: Application to tabu search for the simple Job-Shop-Scheduling Problem - L. Deroussi, G. Fleury, M. Gourgand A New Characterization of Neighbouring Systems 16:00 bye bye ... ================================================================================ SOME REGISTRATION INFORMATIONS REGISTRATION FORM for ECCO-XII, BENDOR, MAY 27-29, 1999. This is the standard form used to register for ECCO-XII. You must fill in a form for each participant. WARNING: If the conference fee of the registrant is not paid before March 15, 1999, the registration will be discarded. - - ----------------------------------------------------------------------- REGISTRATION FIRSTNAME: LASTNAME: AFFILIATION: INSTITUTION: STREET: ZIP_CODE: CITY: COUNTRY: EMAIL: PHONE: FAX: - - ----------------------------------------------------------------------- Please send the above form by e-mail to ecco99@lim.univ-mrs.fr. Conference fee should be payed to : Tresorerie Principale de Marseille Agent Comptable de l'Universite de la Mediterranee Reference : TP MARSEILLE 10071 13000 00003005399 78 Conference fee: 300 FF. ===================================================================== HOW TO GET TO Bendor Island Airport buses from Marseille Provence Airport are available to join Marseille St-Charles station. TGV from Paris or Lyon arrive also at St-Charles railway station. From St-Charles railway station, take a regional trains to join Bandol. In Bandol go to the harbour (10 minutes walk) to take the boat to Bendor Island. ===================================================================== ACCOMODATION ------------ Hotel Delos Meeting Hotel **** Reservations should be made directly at the hotel Delos : Ile de Bendor - 83150 Bandol Tel. (0)4 94 32 22 23 - Fax. (0)4 94 32 41 44 http : //www.delos.com The number of rooms in the Delos Hotel is limited (55). However, the direction of the Delos Hotel will arrange reservations in other hotels either in the Bendor Island or in Bandol. ===================================================================== For further information write to the e-mail address: ecco99@lim.univ-mrs.fr ****************************************************** 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) http://www.math.utwente.nl/stor/OR/dmanet.html