Final CFP: CP98 workshop on large scale combinatorial optimization

Subject: Final CFP: CP98 workshop on large scale combinatorial optimization
From: Stefano Bistarelli (
Date: Fri Jul 31 1998 - 12:48:22 MET DST

                          CALL FOR PAPERS
                           CP98 Workshop
      Large Scale Combinatorial Optimisation and Constraints

                           Pisa, Italy
                         30 October 1998
(in conjunction with the fourth International Conference on Principles
and Practice of Constraint Programming (CP98))

This workshop will explore hybrid algorithms for complex optimisation
problems. These will be based on the integration of different
approaches, viz. constraint programming, mathematical programming and
stochastic repair techniques. These approaches have sometimes been
perceived as competitors, but more recently they have come to be seen
as complementary.

The need for such algorithms in solving optimisation problems arises
from the fact that different techniques are suited to solving
different aspects of the problem. Among the key techniques are
constraint propagation, Lagrangean relaxation, linear programming,
randomised search and local optimisation. Constraint propagation is
ideal for customising an algorithm with domain-dependent constraints.
Lagrangean relaxation is the technique of choice for obtaining lower
bounds in a branch and bound approach. Linear programming is the only
technique that can solve to optimiality large linear
problems. Randomised search is necessary for problems that are too
large for branch and bound. Local optimisation is the preferred
technique for problems that have a specific neighbourhood structure,
such as routing problems.

Many optimisation problems are hybrid, embracing several different
requirements. For example real-life dispatching problems involve both
matching, routing and scheduling. For such problems there is a clear
need to mix techniques. This mixing can take different forms. On one
hand generic methods, such as tabu search or constraint propagation
can be significantly enhanced by importing techniques developed for
branch and bound (such as edge-finding) or for local optimisation
(such as neighbourhood structure). On the other hand different
techniques can be applied at different stages of the search. For
instance initial solutions can be found using constructive search with
constraint propagation, and the solution can then be improved through
local optimisation.

The workshop invites submissions related to LSCO and
Constraints. Topics of interest include:

-- hybrid algorithms
-- LSCO applications solved using hybrid algorithms
-- Methods for integrating different techniques
-- Methodologies for devising application-specific hybrid algorithms
-- Platforms supporting experimentation with hybrid algorithms
-- Surveys of existing hybrid techniques and related literature


Submission deadline is 15 August 1998. Authors are invited to submit
original papers written in English and approximately 10 A4
pages to either Mark Wallace or Yves Caseau at the contact address
We encourage authors to submit by electronic mail in Word or self-contained
Postscript format. Alternatively 3 paper copies may be submitted by post.

Decisions on acceptance will be sent to authors by by 15 September 1998.


-- Mark Wallace
IC-Parc, William Penney Laboratory
Imperial College, London SW7 2BZ, UK

-- Yves Caseau
Bouygues, Challenger, 1 Av Eugene Freyssinet,
78061 St-Quentin-Yvelines Cedex, FRANCE

-- Eric Jacquet-Lagreze, EuroDecision

-- Helmut Simonis, Cosytec

-- Gilles Pesant
Centre for Research on Transportation, Univ. Montreal
-- 15 August 1998: Paper submissions
-- 15 September 1998: Acceptance decisions
-- 10 October 1998: Final copy due
-- 30 October 1998: Workshop


Additional information about CP98 will be available at the CP98 web site:

This archive was generated by hypermail 2b25 : Fri Mar 03 2000 - 16:17:15 MET