The workshop is partially sponsored by ÖGOR - The Austrian Operations Research Society.
The workshop is a two-day, single stream event focussing at
polynomially solvable or approximable
special cases of provably hard combinatorial optimization problems.
This line of research deals with NP-hard combinatorial optimization
problems which become polynomially tractable if specific structural propertiesare imposed on their input.
The identification of the sometimes thin boarderline between hard and tractable cases is often a hard and interesting challenge.
The workshop hosts invited talks as well as contributed talks and discussions
or working sessions.
Special structures in polynomially solvable cases: Is there much in common?
Abstract (pdf)
Martin Milanič, University of Primorska, Slovenia
Vector connectivity in graphs Abstract (pdf)
Frits Spieksma, KU Leuven, Belgium
Multi-index assignment problems: an overview Abstract (pdf)
Gerhard Woeginger, Eindhoven Unioversity of Technology, The Netherlands
Tractable special cases through linear algebra Abstract (pdf)
| 08:30-8:50 | Registration | |
| 08:50-9:00 | Opening | |
| 09:00-10:00 | Gerhard J. Woeginger (Eindhoven University of Technology, NL) | Tractable special cases through linear algebra |
| 10:00-10:30 | Coffee Break | |
| 10:30-11:30 | Frits Spieksma (KU Leuven, Belgium) | Multi-index assignment problems: an overview |
| 11:35-12:05 | Matteo Seminaroti (CWI Amsterdam, NL) | The quadratic assignment problem is easy for Robinsonian matrices |
| 12:05-14:15 | Lunch (registration required) | |
| 14:15-14:45 | Ante Custic (University of Zagreb, Croatia) | The planar 3-dimensional assignment problem with Monge-like cost arrays |
| 14:50-15:20 | Marie MacCaig (University of Birmingham, UK) | The integer image problem in the max algebra |
| 15:25-15:55 | Rotislav Stanek (University of Graz) | A polynomial solvable case of the data arrangement problem on binary trees | 15:55-16:25 | Coffee Break |
| 16:25-17:15 | Open problem session |
| 09:00-10:00 | Vladimir Deineko (Warwick Business School, UK) | Special structures in polynomially solvable cases: Is there much in common? |
| 10:00-10:30 | Coffee Break | |
| 10:30-11:30 | Martin Milanic (University of Primorska, Slovenia) | Vector connectivity in graphs |
| 11:35-12:05 | Nina Chiarelli (University of Primorska, Slovenia) | Linear separation of variants of dominating sets in graphs |
| 12:05-14:15 | Lunch (registration required) | |
| 14:15-14:45 | Joachim Schauer (University of Graz) | The knapsack problem on weakly chordal conflict graphs |
| 14:50-15:45 | Open problem session |
Please do not hesitate to contact scco14[at]math.tugraz.at for any additional information.
Last Update: December 2014