LANCS International Workshop on
Discrete and Nonlinear Optimisation
Cardiff, 13th-15th May 2013
The conference booklet, with programme and abstracts, can be found here.
Purpose and ScopeLANCS is a consortium of Operational Research groups from four British universities. This workshop, which was organised by the LANCS Optimisation Research Cluster, focused on discrete and nonlinear optimisation. Historically, there has been a fruitful interaction between these two fields, which methods from one branch being applied to problems in the other. The purpose of the workshop was to facilitate further interaction of this kind.
Location and DateThe workshop took place in the Mathematics Institute, Senghennydd Road, Cardiff. The workshop began on Monday 13th May 2013 in the morning, and finished on Wednesday 15th around lunchtime.
Organizers:The organizers were Iskander Aliev (Cardiff), Joerg Fliege (Southampton) and Adam N. Letchford (Lancaster).
- Immanuel Bomze (Vienna): A nasty cone with nice properties - new issues in copositive optimization
- Friedrich Eisenbrand (EPFL): Diameter of polyhedra: Abstractions, upper bounds and open problems
- Andreas Fischer (TU Dresden): Local methods for equations with nonisolated solutions
- Etienne de Klerk (Tilburg & NTU Singapore): A comparison of semidefinite programming relaxations for the quadratic assignment problem
- Frank Vallentin (Cologne): A semidefinite programming hierarchy for geometric packing problems
- Luis Nunes Vicente (Coimbra): Zero-order methods: global rates and randomness
- Iskander Aliev (Cardiff): Chvatal-Gomory cutting planes: iterations of multipliers modulo one
- Yalin Bi (Southampton): Customer choice models in revenue management.
- Joerg Fliege (Southampton): Robust multiobjective portfolio optimization
- Franklin Djeumou Fomeni (Lancaster): A dynamic programming heuristic for the quadratic knapsack problem.
- Laura Galli (Pisa): Second-order cone models for delay-constrained routing
- Jonathan Gillard (Cardiff): Optimization challenges for Hankel-structured low rank approximation
- Arash Gourtani (Southampton): Robust facility location problems
- James Heppell (Southampton): The use of global optimisation to capture the effects of water movement through soil.
- Konstantinos Kaparis (Lancaster): Cutting planes for first-level RLT relaxations of mixed 0-1 programs
- Adam N. Letchford (Lancaster): Computing upper bounds for the stable set problem using Lagrangian relaxation
- Eva Linke (Magdeburg): Integer points in knapsack polytopes and s-covering radius
- Andrea Lodi (Bologna): Experiments with linear versus nonlinear formulations of support vector machines with ramp loss
- Tri-Dung Nguyen (Southampton):Optimal coalition structure generation in large games
- From Cardiff: Alexander Balinsky, Roger Behrend, Dafydd Evans, Paul Harper, Penny Holborn, Vincent Knight, Izabela Komenda, Nikolai Leonenko, Matthew Lettington, Rhyd Lewis, Ross McKenzie, Angela Mihai, Dilpak Haje Mohammed, Andrey Pepelyshev, Karl Michael Schmidt, Jonathan Thompson, Maria Vronskaya, Anatoly Zhigljavsky.
- From Lancaster: Saeideh D. Nasiri, Emma Ross, Xinan Yang.
- From Southampton: Dirk Banholzer.
- From Warwick: Xuan Vinh Doan.
- From overseas: Boubekeur Dokkar (Ouargla, Algeria), Gamal Elkhier Elabwabi Elfadul (Khartoum), Sami Hajaig (Qatar Foundation), Martin Henk (Magdeburg), Idowu Osinuga (Abeokuta, Nigeria).