Final Program


December 13, 2004 (Monday)

Section A.

8:30 am - 9:00 am Opening and Introduction
9:00 am - 10:00 am Plenary Session 1 (Chairperson: T. Terlaky)
Nonlinear Optimization at Watson.
Andrew R. Conn
10:00 am - 10:30 am Coffee break
10:30 am - 12:00 am Parallel Session 1A (Chairperson: T. Rapcsák)
Approximation algorithm for the mixed fractional packing and covering problem.
Klaus Jansen
Improved approximation algorithms for scheduling malleable tasks with precedence constraints.
Hu Zhang
Primal-dual algorithms for data depth.
Vera Rosta
12:00 am - 1:30 pm Lunch
1:30 pm - 2:30 pm Plenary Session 2 (Chairperson: S. Komlósi)
An SQP method for semidenfinite programming.
Florian Jarre, Christoph Vogelbusch, Roland W. Freund
2:30 pm - 3:30 pm Plenary Session 3 (Chairperson: J. Mayer)
Complete search for constrained global optimization.
Arnold Neumaier
3:30 pm - 4:00 pm Coffee break
4:00 pm - 6:00 pm Parallel Session 2A (Chairperson: A. Neumaier)
Design and implementation of spreadsheet algorithms in production man- agement.
Zoltán Kovács
Reducing the complexity of capacity analysis in flexible manufacturing systems by operation type based aggregation.
Viktor Juhász, Tamás Koltai
Production planning model of an oil company.
Zsolt Csizmadia, Tibor Illés, Yu Da

Section B.

10:30 am - 12:00 am Parallel Session 1B (Chairperson: F. Glineur)
New variant of the Mizuno-Todd-Ye predictor-corrector algorithm for sufficient matrix linear complementarity problem.
Tibor Illés, Marianna Nagy
A new Mizuno-Todd-Ye type algorithm for linear optimization.
Zsolt Darvay
New primal-dual interior-point methods based on kernel functions.
Mohamed El Ghami, Y. Q. Bai, Kees Roos
12:00 am - 1:30 pm Lunch
4:00 pm - 6:00 pm Parallel Session 2B (Chairperson: T. Rapcsák)
A verified optimization technique to prove and locate chaotic regions.
Balázs Bánhelyi, Tibor Csendes, Barna Garay
Global optimization techniques for stability analysis of decision functions.
János Fülöp, Sándor Z. Németh
On the c-repacking on-line bin packing problem: lower bounds.
János Balogh, József Békési, Gábor Galambos
Matrix inverses, rigid circuit graphs, fibonacci heaps, homotopies, polyhedra and probability bounding.
Mihály Hujter

Section C.

10:30 am - 12:00 am Parallel Session 1C (Chairperson: Cs. Fábián)
A comparative study of evolutionary methods for optimal design of shallow space trusses.
Anikó Csébfalvi
Lot sizing methods - review and comparative analysis, development and advantages arising from genetic algorithms application.
Joanna Oleskow
12:00 am - 1:30 pm Lunch
4:00 pm - 6:00 pm Parallel Session 2C (Chairperson: A. Csébfalvi)
Local optimization algorithms and deterministic chaos.
Vitaly E. Podobedov
Metaheuristic scheme to find good solutions with running time limitation.
Ákos Ladányi, Alpar Jüttner, Tibor Cinkler
An XML-based interface to use Statecharts in specifying and dealing with Performance Models.
Ana S.M.S. Amaral, Rene Rodrigues Veloso, Nandamudi L. Vijaykumar, Carlos Renato Lisbo Frances, Edvar da Luz Oliveira
Optimization of Production Nets under Temporal Constraints
Szilvia Varró-Gyapay, András Pataricza, Ádám Nagy

December 14, 2004 (Tuesday)

Section A.

8:30 am - 9:30 am Plenary Session 4 (Chairperson: I. Maros)
Conic Optimization and some recent applications.
Kees Roos
9:30 am - 10:30 am Plenary Session 5 (Chairperson: T. Csendes)
Solving Semidefinite Programs using Bundle Methods and the Augmented Lagrangian Approach.
Franz Rendl
10:30 am - 11:00 am Coffee break
11:00 am - 12:30 am Parallel Session 3A (Chairperson: K. Roos)
Sequential quadratic programming applied to control theory problems.
Catherine Buchanan
Nonnegative polynomials, linear recurrences and decomposition into rank-one Hankel matrices.
Francois Glineur
Systems of quadratic inequalities and the S-lemma.
Imre Pólik, Tamás Terlaky
12:30 am - 2:00 pm Lunch
2:00 pm - 3:30 pm Parallel Session 4A (Chairperson: J-P. Vial)
Level decomposition for two-stage stochastic programming problems.
Csaba Fábián, Zoltán Szőke
Estimation of rare event probabilities in stochastic networks with exponential and beta distributions.
Ashraf A. Gouda, Tamás Szántai
Recent developments concerning the modeling system SLP-IOR.
Peter Kall, János Mayer
3:30 pm - 4:00 pm Coffee break
4:00 pm - 5:00 pm Plenary Session 6 (Chairperson: A. Frank)
Generating all vertices in implicitly defined polytopes
Komei Fukuda
5:00 pm - 6:00 pm Plenary Session 7 (Chairperson: T. Illés)
A family of structured set covering problems.
Jakob Krarup

Section B.

11:00 am - 12:30 am Parallel Session 3B (Chairperson: K. Fukuda)
The problem of making a digraph k-vertex connected by adding a minimum number of edges.
László Végh
Maximum even factor algorithm.
Gyula Pap
An algorithm for source location in directed graphs.
Mihály Bárász, Johanna Becker, András Frank
12:30 am - 2:00 pm Lunch
2:00 pm - 3:30 pm Parallel Session 4B (Chairperson: Cs. Mészáros)
New criss-cross type algorithms for linear complementarity problems with sufficient matrices.
Zsolt Csizmadia, Tibor Illés
Remarks on submodular functions and related set function classes.
Stephan Foldes
Exploiting symmetry in graph to eciently compute Lovasz type bounds.
Igor Djukanovic, Franz Rendl

Section C.

12:30 am - 2:00 pm Lunch
2:00 pm - 3:00 pm Parallel Session 4C (Chairperson: Zs. Darvay)
Particle swarm method as a new tool for single and multiobjective optimization.
Károly Jármai
Criticality in resource constrained projects.
György Csébfalvi, Roni Levi

December 15, 2004 (Wednesday)

Section A.

8:30 am - 9:30 am Plenary Session 8 (Chairperson: F. Friedler)
Multicommodity flows.
Jean-Philippe Vial
9:30 am - 10:30 am Plenary Session 9 (Chairperson: T. Rapcsák)
Convergence to second order stationary points in nonlinear programming.
Gianni Di Pillo
10:30 am - 11:00 am Coffee break
11:00 am - 12:30 am Parallel Session 5A (Chairperson: A. R. Conn)
An exact penalty method for smooth equality constrained optimization
T. Rapcsák, W. Bergsma
Use of Empirical Likelihood in Optimal Pre-control Plans
Vicent Giner, Susana San Matas
Synthesis of MIP Model for PNS
Ferenc Friedler, L. T. Fan
12:30 am - 2:00 pm Lunch
2:00 pm - 4:00 pm Parallel Session 6A (Chairperson: V. Rosta)
Sparse simplex methods applied to quadratic programs and quadratic mixed integer programs.
Frank E.F.D. Ellison, M. Guertler, Guatam Mitra
Recent achievements in interior point technology.
Csaba Mészáros
Algorithmic and implementation aspects of parametric and sensitivity analysis in convex quadratic optimization.
Oleksandr Romanko, Tamás Terlaky, Alireza Ghaari Hadigheh
Current state of the dual simplex method.
István Maros

Section B.

11:00 am - 12:30 am Parallel Session 5B (Chairperson: F. Rendl)
LEMON - a Software Library for Efficient Modeling and Optimization in Networks.
Alpár Jüttner
On the scheduling problem in the combinatorial model of the PNS problem.
Csanád Imreh
Dénes König, the father of the "Hungarian method"
Zsuzsanna Libor
12:30 am - 2:00 pm Lunch
2:00 pm - 4:00 pm Parallel Session 6B (Chairperson: M. Hujter)
Engine assignment problem under some operation policy for railway transportation.
Tibor Illés, Márton Makai, Endre Németh, Zsuzsanna Vaik
Assessing store performance equitably.
Gábor Pauler, Minakshi Trivedi, Dinesh Kumar Gauri
A new resource leveling milp model for multi-mode projects based on global measure.
Etelka Szendrői
New exact and heuristic solution procedures for the setup cost oriented resource leveling problem.
László Torjai

Section C.

11:00 am - 12:30 am Parallel Session 5C (Chairperson: Gy. Csébfalvi)
Continuous vs Discrete-Time Approaches in Batch Chemical Process Scheduling - Application to Heat Integration.
Thokozani Majozi
An exact resource allocation model with hard and soft resource constraints.
Ferenc Kruzslicz