Call for Participation
=========================================
International Symposium on Combinatorial Optimization (CO 2008)
16-19 March 2008, University of Warwick, Coventry, UK
http://go.warwick.ac.uk/co2008
=========================================
Registration is now open! Early registration deadline: 14 February
2008
CO 2008 is an International Symposium on Combinatorial Optimization. It
is the next in a series of biennial conferences. The last few
conferences were held in Porto (2006), Lancaster (2004), Paris (2002),
Greenwich
(2000), Brussels (1998), and London (1996). CO 2008 is hosted by the
University of Warwick, UK.
PLENARY SPEAKERS
Moshe Dror, University of Arizona, USA
Another Look at Euclidian TSP and Packing: "This" Almost Never
Happens
Adam Letchford, Lancaster University, UK
The Max-Cut and Max-Clique Problems: Linear versus Semidefinite
Programming
Rolf Möhring, Technische Universität Berlin, Germany
Routing in Graphs with Applications in Traffic and Logistics
CONTRIBUTED TALKS
See listing at the end of this mail.
Full papers can be submitted for publication in the special issue of
the Journal of Combinatorial Optimization after the conference (not
restricted to accepted presentations), subject to the normal review
process of the journal. Details will be published on the website of
CO2008 in due course.
CONFERENCE WEBSITE
Further information can be found on the conference website:
http://go.warwick.ac.uk/CO2008/
IMPORTANT DATES
14 February 2008: Last date for early registration
16 March 2008: Start of symposium
List of accepted presentations:
============================
* Tariq Salih Abdul-Razaq and Hussein Mutashar. Exact and Local Search
Methods for Three Machine Flow Shop with Transportation Times
* Alessandro Agnetis, Marta Flamini, Gaia Nicosia and Andrea Pacifici.
A branch and bound algorithm for a generalized Job Shop Scheduling
problem
* Aysegul Altin, Hande Yaman and Mustafa C. Pinar. The Robust Network
Loading Problem under Polyhedral Demand Uncertainty: Formulation,
Polyhedral Analysis, and Computations
* Mary Ashley, Tanya Berger-Wolf, Piotr Berman, Wanpracha
Chaovalitwongse, Bhaskar DasGupta and Ming-Yang Kao. Approximating
Several Covering/Packing Problems
* Osorio Lama Maria Auxilio, Nohemi Machorro and Sánchez López Abraham.
On the use of surrogate constraint analysis to fix binary variables in
CFLP
* Haris Aziz and Mike Paterson. Computing voting power in easy weighted
voting games
* Lucile Denoeud Belgacem and Nicolas Puech. A
Graph-Partitioning-Based-Heuristic for Optical Network Planning Problem
* Luís Felipe H. Bento, André Gustavo dos Santos and Geraldo Robson
Mateus. Airline Crew Scheduling: A hybrid approach using metaheuristics
to improve an exact column generation algorithm
* Peter Biro and Tamas Fleiner. Integral stable allocation problem on
graphs
* Synara Brito, Sulamita Klein, Loana Nogueira and Fabio Protti.
Forest-clique partitions of cographs
* Edmund K. Burke, Jakub Marecek and Andrew J. Parkes. Where is the
Symmetry in Vertex Colouring?
* Edmund K. Burke, Jakub Marecek and Andrew J. Parkes. Zykov Revisited
* Paula Carroll. Polyhedral Investigation of the Ring Spur Assignment
Problem
* Daniele Catanzaro, Raffaele Pesenti and Michel C. Milinkovitch.
Estimating phylogenies under maximum likelihood: A very large-scale
neighborhood approach
* Sofie Coene and Frits Spieksma. Profit-based Latency Problems on the
Line
* Thomas Erlebach and Erik Jan van Leeuwen. Approximating Geometric
Coverage Problems
* Richard Fernandes, Arie Koster and Vladimir Deineko. An Integer
Linear Programming approach for a Dispatching Problem
* Rosa Figueiredo, Martine Labbe and Antonio Mauttone. A Tabu Search
approach to solve the mixed integer bilevel formulation of a network
design problem
* Robert Fisher, Dmitriy Drusvyatskiy and Joel Wein. Scheduling Tasks
on Parallel Machines with Network Based Restrictions
* Edward Kh. Gimadi. On Asymptotic Optimality of a Polynomial Algorithm
for the Multi-TSP in the Euclidean Space
* Yury Glazkov and Edward Gimadi. Asymptotically optimal algorithms for
m-layer planar 3-dimensional assignment problem
* Cristiana Gomes, Gurvan Huiban and Hervé Rivano. A Branch-and-Price
Approach to the Bandwidth Allocation Problem in Wireless Networks
* Teresa Gomes, José Craveirinha and Luísa Jorge. An effective
algorithm for obtaining the set of all minimal cost pair of disjoint
paths with dual arc costs
* Peter Hahn, Yi-Rong Zhu, William Hightower and Monique
Guignard-Splielberg. A Level-3 Reformulation Linearization Technique
Lower Bound for the Quadratic Assignment Problem (QAP)
* Nicholas Hall, Marc Posner and Chris Potts. Online Scheduling with
Known Arrival Times
* Géraldine Heilporn, Martine Labbe, Patrice Marcotte and Gilles
Savard. On a Network Pricing Problem with Connected Toll arcs
* Stan van Hoesel, Arie Koster and Bert Marchal. A local search
algorithm for determining tree decompositions of graphs
* Olivier Hudry. Complexity of the computation of a linear order at
minimum distance from a tournament
* Shinji Imahori and Mutsunori Yagiura. Improved best-fit heuristics
for rectangular strip packing and bin packing problems
* Kacem Imed. 2-Approximation Algorithm for the weighted flowtime
minimization on a single machine with a fixed non-availability interval
* Oliver Jenkinson. Balanced words and majorization
* Marcin Kaminski. Quadratic programming on graphs without long odd
cycles
* Konstantinos Kaparis and Adam Letchford. Separation Algorithms for
0-1 Knapsack Polytopes
* Hans Kellerer and Günther Wirsching. A strongly polynomial algorithm
for convex quadratic programming with a fixed number of constraints
* Shahul Hamid Khan .B. Optimization of Genetic Algorithm Parameters in
Flow Shop Scheduling using Grey Relational Analysis
* Shahul Hamid Khan .B. A Multi Objective Simulated Annealing Algorithm
for Scheduling in Flow Shop to minimize makespan and maximum tardiness
* Arie Koster, Sebastian Orlowski, Christian Raack, Georg Baier and
Thomas Engel. Branch-and-cut techniques for solving realistic two-layer
network design problems
* Arie Koster, Manuel Kutschka and Adrian Zymolka. Separation of
{0,1/2}-Chvátal-Gomory cuts in general integer programs
* Fredrik Kuivinen. Submodular functions on diamonds
* Adam Letchford and Nik Pearson. Good Triangulations Yield Good Tours
* Janny Leung and Rachel Wong. Timetable Syncronisation for Rail Mass
Transit
* Igor Litvinchev and Socorro Rangel. A modified Lagrangian bound for a
class of many-to-many assignment
* Eliane Loiola, Nair Abreu and Richard Schachter. Restricted quadratic
assignment problem for naval architecture: a case-study
* Vadim Lozin. Stability Preserving Transformations of Graphs
* Eric McDermid and David Manlove. Keeping partners together:
Algorithmic results for the Hospitals / Residents problem with couples
* Isabel Méndez-Díaz and Paula Zabala. The (k, k - 1)-coloring problem
* Dolores Romero Morales and Jingbo Wang. Discretizing Continuous
Variables for Support Vector Machines by Means of Classification Trees
* Qianxin Mu and Richard Eglese. Disruption Management in Vehicle
Routing and Scheduling
* Ulrich Pferschy and Gerald Hubmann. A Balanced Vehicle Routing
Problem
* Petrica Cluadiu Pop and Corina Pop Sitar. On The Generalized Minimum
Spanning Tree Problem
* Petrica Cluadiu Pop. A Strong Integer Programming Formulation of the
Generalized Traveling Salesman Problem
* Michael Poss, Bernard Fortz and Martine Labbe. Constraints generation
for solving a bilayer network design problem
* Christian Raack and Arie Koster. The cut-set polytope for two-layer
network design problems
* Socorro Rangel, Altamir Figueiredo and Gabriela Mosquera. Special
cutting patterns and reduction of saw machine set ups in the cutting
stock problem
* Stefan Ropke, Jean-Francois Cordeau and Gilbert Laporte. Computer
aided discovery of families of valid inequalities
* Fabrizio Rossi, Mara Servilio and Stefano Smriglio. Large-scale Call
Center Agents Scheduling
* Ivan A. Rykov. Asymptotically exact approach to solving RCPSP with
one resource type
* Maria Paola Scaparra and Richard Church. A multi-level optimization
model for improving the robustness of capacitated service and supply
systems
* Natalia Shakhlevich, Akiyoshi Shioura and Vitaly Strusevich. Solving
Make-or-Buy Trade-off Problems by Submodular Optimization
* Oleg Shcherbina. Tree decomposition and postoptimality analysis in
discrete optimization
* Oguz Solyali, Haldun Sural and Meltem Denizel. Strong formulations
for the one-warehouse multi-retailer problem
* Nicolas Sonnerat and Adrian Vetta. Galaxy Cutsets in Graphs
* Frits Spieksma. Multi-Index Assignment Problems: Applications and
Approximation
* Tami Tamir and Benny Vaksendiser. Algorithms for Storage Allocation
Based on Client Preferences
* S. Armagan Tarim, Semra Karacaer, Robert Rossi, Brahim Hnich and
Steven Prestwich. Scheduling Internal Audit Activities: A Stochastic
Combinatorial Optimization Problem
* Tran Tuan Vu, Moussouni Fouzia, Brisset Stéphane and Brochet Pascal.
Global Constrained Optimization of a Safety Transformer using
Branch-and-Bound method
* W.K. Wong, X.X. Wang, S.Y.S. Leung, P.Y. Mok and J.T. Fan. A hybrid
approach by integrating heuristic packing and evolutionary strategy for
packing irregular objects
|
