• Non ci sono risultati.

Rich models in discrete optimization: formulation and resolution (ECCO XVI)

N/A
N/A
Protected

Academic year: 2021

Condividi "Rich models in discrete optimization: formulation and resolution (ECCO XVI)"

Copied!
3
0
0

Testo completo

(1)

Editorial

Rich models in discrete optimization:

Formulation and resolution

(ECCO XVI)

This special issue of European Journal of Operational Research is devoted to the ECCO XVI Conference, the sixteenth annual meeting of the Euro-pean Chapter on Combinatorial Optimization, held at the Molde University College (Norway), from June 5 to June 7, 2003. (You can still visit the conference web site at http://www.himolde.no/arrang/eccoXVI/.)

ECCO, the EURO Working Group on Combinatorial Optimization, was created in 1987 by C. Roucairol, D. De Werra and A. Rinnooy Kan. It provides an excellent opportunity to discuss recent and important issues in combinatorial optimization and its applications. The group, which has about 700 members, is open to everybody interested in the field, either in theoretical aspects or in business, industry or public administration appli-cations. During the first ten years, Catherine Roucairol (Universit´e de Ver-sailles, France) coordinated the ECCO activities. The current coordinator is Silvano Martello (University of Bologna, Italy).

The ECCO meetings are held on a regular basis (once a year during Spring) and are devoted to all aspects of combinatorial optimization: oper-ations management and logistics, production scheduling, location and dis-tribution problems, resource allocation, flexible manufacturing, scheduling, VLSI design and computer design, network optimization, etc. At ECCO meetings usually about 100 participants nicely combine scientific works and exchange of new ideas with an exciting atmosphere like Paris (May 1988), Venice (June 1989), Barcelona (May 1990), Dubrovnik (May 1991, canceled due to the unstable political situation in Croatia), Graz (April 1992), Brux-elles (April 1993), Milano (February 1994), Poznan (May 1995), Dublin (April 1996), Tenerife (May 1997), Copenhagen (May 1998), Bendor (May 1999), Capri (May 2000), Bonn (2001), Lugano (2002), Molde (2003), Beirut (2004), Minsk (2005).

The Scientific Program Committee for ECCO XVI was formed by Jacek BÃla˙zewicz (Technical University of Poznan, Poland), Van-Dat Cung (Uni-versity of Versailles, France; now at GILCO Laboratory, Grenoble), Alain Hertz (Universit´e de Montr´eal, Canada), Arne Løkketangen (Molde

(2)

sity College, Norway), Silvano Martello (University of Bologna, Italy), and Paolo Toth (University of Bologna, Italy). The meeting was organized by Arne Løkketangen. We would like to thank Oyvind Halskau , Grete Notøy, Berit Svendsvik and Stein W. Wallace, all from the Molde University Col-lege, for their service in the Organizing Committee. The conference dinner was held at the Finnøya sjøhus, a restaurant with atmosphere located on a charming island (http://www.havstuene.no/), that was reached with a high speed passenger express boat.

During the conference, the following plenary talks were given:

• Piotr Formanowicz (Institute of Computing Science, Poznan

Univer-sity of Technology and Polish Academy of Sciences), “On some com-binatorial problems of computational biology”;

• Claude Le Pape, ILOG S.A.,“Two generic schemes for efficient and

robust cooperative algorithms”;

• Stein W. Wallace, Molde University College. “The role of stochastics

in optimization: Why it is dangerous to overlook it”.

Additionally, sixteen sessions were organized, in two or three parallel streams, on the following main topics: vehicle routing, scheduling, meta-heuristics, networks and combinatorics. In these sections, 39 papers were presented and discussed. After the conference nineteen papers have been submitted to the special issue“Rich models in discrete optimization: For-mulation and resolution” and, after a thorough refereeing process, nine pa-pers have been selected for publication. We would like to thank Mrs. Rita Mambelli, secretary at the University of Bologna, for her help in organizing and handling the refereeing process.

The objective of this special issue is to investigate the formulation of rich models in discrete optimization, and the development of accompanying exact and heuristic solution methods, in all kinds of real-world application. As computers are getting progressively faster and solution methods are im-proving, more attempts are made of formulating and solving richer models of complex real-world discrete optimization problems. By rich model, we un-derstand a non-idealized model that represents the application at hand in an adequate way by including all important optimization criteria, constraints, and preferences.

The organizers of ECCO XVI thank all the institutions which supported the meeting. Thanks are due in particular to:

(3)

• City of Molde;

• EURO, the Association of European Operational Research Societies; • Molde University College.

We also thank SINTEF Applied Mathematics, Møre Research, ILOG and the Norwegian Research Council for their sponsorship.

All the papers of this special issue were strictly refereed. We would like to thank the referees for their fruitful remarks and comments.

Geir Hasle

SINTEF Applied Mathematics, Department of Optimization Oslo, Norway.

E-mail: Geir.Hasle@sintef.no

http://www.math.sintef.no/opti/staff/gha.html Arne Løkketangen

Molde University College Molde, Norway.

E-mail: Arne.Lokketangen@hiMolde.no

http://www.himolde.no/∼arnel/ Silvano Martello

DEIS, Universit`a di Bologna Bologna, Italy.

E-mail: smartello@deis.unibo.it

http://www.or.deis.unibo.it/martello.html

Riferimenti

Documenti correlati

* Alberto Quagliata wrote Introduction and Art and learning; Lavinia Bianchi wrote Bateson, Picasso, Matisse, Van Gogh and Frida Kahlo.... approach of the narrative

Notice that, since any spanning tree that provides an optimal solution of the linear-programming problem must be an MST, and since the proof used only the fact that T was generated

We next consider the problem of finding a maximum-weight common independent set, in two given matroids, with a given weight function. The algorithm, again due to Edmonds [1970], is

I Two lab exercises: implementation of 1) a MILP model and 2) a metaheuristic, to be delivered some days before the oral examination. Mandatory [1-10 /30,

I Lecture notes provided by the teacher + articles from scientific journals (available before the class: read them!). I Optimization software packages available on line and

- Applications: production planning optimization, network flows Advanced methods for Mixed Integer Linear Programming (MILP).. - Branch & Bound and relaxation techniques

Solving an optimization problem formulated as a mathematical programming model means deciding the values of the variables that satisfy all the constraints and maximize or minimize

For example, when problems are strongly constrained and a feasible solution is not available, a first step is to find a feasible solution, which can be done by starting from