Emerging optimization problems for distribution in same-day delivery - Yuanyuan Li; Claudia Archetti; Ivana Ljubic (Comput. Oper. Res., 2025)

Last fifty years of integer linear programming: A focus on recent practical advances - François Clautiaux; Ivana Ljubic (Eur. J. Oper. Res., 2025)

New formulations for two location problems with interconnected facilities - Yerlan Kuzbakov; Ivana Ljubic (Eur. J. Oper. Res., 2024)

Benders decomposition for the discrete ordered median problem - Ivana Ljubic; Miguel A. Pozo; Justo Puerto; Alberto Torrejón (Eur. J. Oper. Res., 2024)

The Impact of Passive Social Media Viewers in Influence Maximization - Michael Kahr; Markus Leitner; Ivana Ljubic (INFORMS J. Comput., 2024)

Operational Research: methods and applications - Fotios Petropoulos; Gilbert Laporte; Emel Aktas; Sibel A. Alumur; Claudia Archetti; Hayriye Ayhan; Maria Battarra; Julia A. Bennell; Jean-Marie Bourjolly; John E. Boylan; Michèle Breton; David Canca; et al. (J. Oper. Res. Soc., 2024)

On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs - Elisabeth Gaar; Jon Lee; Ivana Ljubic; Markus Sinnl; Kübra Taninmis (Math. Program., 2024)

Three network design problems for community energy storage - Bissan Ghaddar; Ivana Ljubic; Yuying Qiu (Networks, 2024)

A Bilevel Approach for Compensation and Routing Decisions in Last-Mile Delivery - Martina Cerulli; Claudia Archetti; Elena Fernández; Ivana Ljubic (Transp. Sci., 2024)

Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates - Yuanyuan Li; Claudia Archetti; Ivana Ljubic (Transp. Sci., 2024)

Benders decomposition for congested partial set covering location with uncertain demand - Alice Calamita; Ivana Ljubic; Laura Palagi (CoRR, 2024)

An exact method for binary fortification games - Markus Leitner; Ivana Ljubic; Michele Monaci; Markus Sinnl; Kübra Taninmis (Eur. J. Oper. Res., 2023)

Mathematical programming formulations for the Collapsed k-Core Problem - Martina Cerulli; Domenico Serra; Carmine Sorgente; Claudia Archetti; Ivana Ljubic (Eur. J. Oper. Res., 2023)

A survey on bilevel optimization under uncertainty - Yasmine Beck; Ivana Ljubic; Martin Schmidt (Eur. J. Oper. Res., 2023)

Exact methods for discrete {\varGamma }-robust interdiction problems with an application to the bilevel knapsack problem - Yasmine Beck; Ivana Ljubic; Martin Schmidt (Math. Program. Comput., 2023)

Two extended formulations for the virtual network function placement and routing problem - Ahlam Mouaci; Éric Gourdin; Ivana Ljubic; Nancy Perrot (Networks, 2023)

Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs - Cristian Ramirez-Pico; Ivana Ljubic; Eduardo Moreno (Transp. Sci., 2023)

A tailored Benders decomposition approach for last-mile delivery with autonomous robots - Laurent Alfandari; Ivana Ljubic; Marcos de Melo da Silva (Eur. J. Oper. Res., 2022)

Comparison of formulations for the Inventory Routing Problem - Claudia Archetti; Ivana Ljubic (Eur. J. Oper. Res., 2022)

Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem - Fabio Furini; Ivana Ljubic; Enrico Malaguti; Paolo Paronuzzi (Oper. Res., 2022)

Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems - Stefano Coniglio; Fabio Furini; Ivana Ljubic (Math. Program., 2022)

Budgeting in International Humanitarian Organizations - Milad Keshvari Fard; Ivana Ljubic; Felix Papier (Manuf. Serv. Oper. Manag., 2022)

Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption - Elena Fernández; Markus Leitner; Ivana Ljubic; Mario Ruthmair (Transp. Sci., 2022)

A Tailored Benders Decomposition Approach for Last-mile Delivery with Autonomous Robots - Ivana Ljubic (Proceedings of the 11th International Conference on Operations Research and Enterprise Systems, ICORES 2022, Online Streaming, February 3-5, 2022, 2022)

SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs - Elisabeth Gaar; Jon Lee; Ivana Ljubic; Markus Sinnl; Kübra Taninmis (Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings, 2022)

Combinatorial Optimization - 7th International Symposium, ISCO 2022, Virtual Event, May 18-20, 2022, Revised Selected Papers - Ivana Ljubic; Francisco Barahona; Santanu S. Dey; Ali Ridha Mahjoub (Springer, 2022)

Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates - Yuanyuan Li; Claudia Archetti; Ivana Ljubic (CoRR, 2022)

On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs - Elisabeth Gaar; Jon Lee; Ivana Ljubic; Markus Sinnl; Kübra Taninmis (CoRR, 2022)

Benders decomposition for a node-capacitated Virtual Network Function placement and routing problem - Ivana Ljubic; Ahlam Mouaci; Nancy Perrot; Éric Gourdin (Comput. Oper. Res., 2021)

A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization - Thomas Kleinert; Martine Labbé; Ivana Ljubic; Martin Schmidt (EURO J. Comput. Optim., 2021)

The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements - Eduardo Álvarez-Miranda; Marcos Goycoolea; Ivana Ljubic; Markus Sinnl (Eur. J. Oper. Res., 2021)

An exact method for assortment optimization under the nested logit model - Laurent Alfandari; Alborz Hassanzadeh; Ivana Ljubic (Eur. J. Oper. Res., 2021)

A branch-and-cut algorithm for the Edge Interdiction Clique Problem - Fabio Furini; Ivana Ljubic; Pablo San Segundo; Yanlu Zhao (Eur. J. Oper. Res., 2021)

Solving Steiner trees: Recent advances, challenges, and perspectives - Ivana Ljubic (Networks, 2021)

SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs - Elisabeth Gaar; Jon Lee; Ivana Ljubic; Markus Sinnl; Kübra Taninmis (CoRR, 2021)

An Exact Method for Fortification Games - Markus Leitner; Ivana Ljubic; Michele Monaci; Markus Sinnl; Kübra Taninmis (CoRR, 2021)

Preface: decomposition methods for hard optimization problems - Fabio Furini; Ivana Ljubic; Emiliano Traversi (Ann. Oper. Res., 2020)

A polyhedral study of the diameter constrained minimum spanning tree problem - Luis Gouveia; Markus Leitner; Ivana Ljubic (Discret. Appl. Math., 2020)

On integer and bilevel formulations for the k-vertex cut problem - Fabio Furini; Ivana Ljubic; Enrico Malaguti; Paolo Paronuzzi (Math. Program. Comput., 2020)

Location of Charging Stations in Electric Car Sharing Systems - Georg Brandstätter; Markus Leitner; Ivana Ljubic (Transp. Sci., 2020)

Virtual Network Functions Placement and Routing Problem: Path formulation - Ahlam Mouaci; Éric Gourdin; Ivana Ljubic; Nancy Perrot (2020 IFIP Networking Conference, Networking 2020, Paris, France, June 22-26, 2020, 2020)

The incremental connected facility location problem - Ashwin Arulselvan; Andreas Bley; Ivana Ljubic (Comput. Oper. Res., 2019)

Benders decomposition for very large scale partial set covering and maximal covering location problems - Jean-François Cordeau; Fabio Furini; Ivana Ljubic (Eur. J. Oper. Res., 2019)

The maximum clique interdiction problem - Fabio Furini; Ivana Ljubic; Sébastien Martin; Pablo San Segundo (Eur. J. Oper. Res., 2019)

A new branch-and-bound algorithm for the maximum edge-weighted clique problem - Pablo San Segundo; Stefano Coniglio; Fabio Furini; Ivana Ljubic (Eur. J. Oper. Res., 2019)

Exact Approaches for Network Design Problems with Relays - Markus Leitner; Ivana Ljubic; Martin Riedler; Mario Ruthmair (INFORMS J. Comput., 2019)

Interdiction Games and Monotonicity, with Application to Knapsack Problems - Matteo Fischetti; Ivana Ljubic; Michele Monaci; Markus Sinnl (INFORMS J. Comput., 2019)

Decomposition methods for the two-stage stochastic Steiner tree problem - Markus Leitner; Ivana Ljubic; Martin Luipersbeck; Markus Sinnl (Comput. Optim. Appl., 2018)

The connected facility location polytope - Markus Leitner; Ivana Ljubic; Juan José Salazar González; Markus Sinnl (Discret. Appl. Math., 2018)

Outer approximation and submodular cuts for maximum capture facility location problems with random utilities - Ivana Ljubic; Eduardo Moreno (Eur. J. Oper. Res., 2018)

A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems - Markus Leitner; Ivana Ljubic; Martin Luipersbeck; Markus Sinnl (INFORMS J. Comput., 2018)

On the use of intersection cuts for bilevel optimization - Matteo Fischetti; Ivana Ljubic; Michele Monaci; Markus Sinnl (Math. Program., 2018)

Stochastic survivable network design problems: Theory and practice - Ivana Ljubic; Petra Mutzel; Bernd Zey (Eur. J. Oper. Res., 2017)

Solving minimum-cost shared arborescence problems - Eduardo Álvarez-Miranda; Ivana Ljubic; Martin Luipersbeck; Markus Sinnl (Eur. J. Oper. Res., 2017)

Feature cluster: Recent advances in exact methods for multi-objective optimisation - Matthias Ehrgott; Ivana Ljubic; Sophie N. Parragh (Eur. J. Oper. Res., 2017)

An algorithmic framework for the exact solution of tree-star problems - Markus Leitner; Ivana Ljubic; Juan José Salazar González; Markus Sinnl (Eur. J. Oper. Res., 2017)

An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem - Fabio Furini; Ivana Ljubic; Markus Sinnl (Eur. J. Oper. Res., 2017)

A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs - Matteo Fischetti; Ivana Ljubic; Michele Monaci; Markus Sinnl (Oper. Res., 2017)

Redesigning Benders Decomposition for Large-Scale Facility Location - Matteo Fischetti; Ivana Ljubic; Markus Sinnl (Manag. Sci., 2017)

Thinning out Steiner trees: a node-based model for uniform edge costs - Matteo Fischetti; Markus Leitner; Ivana Ljubic; Martin Luipersbeck; Michele Monaci; Max Resch; Domenico Salvagnin; Markus Sinnl (Math. Program. Comput., 2017)

A node-based ILP formulation for the node-weighted dominating Steiner problem - Andreas Bley; Ivana Ljubic; Olaf Maurer (Networks, 2017)

Operations Research Proceedings 2015, Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies (GOR, ÖGOR, SVOR/ASRO), University of Vienna, Austria, September 1-4, 2015 - Karl F. Doerner; Ivana Ljubic; Georg Pflug; Gernot Tragler (Springer, 2017)

ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design - Markus Leitner; Ivana Ljubic; Markus Sinnl; Axel Werner (Comput. Oper. Res., 2016)

Benders decomposition without separability: A computational study for capacitated facility location problems - Matteo Fischetti; Ivana Ljubic; Markus Sinnl (Eur. J. Oper. Res., 2016)

A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints - Markus Sinnl; Ivana Ljubic (Math. Program. Comput., 2016)

Intersection Cuts for Bilevel Optimization - Matteo Fischetti; Ivana Ljubic; Michele Monaci; Markus Sinnl (Integer Programming and Combinatorial Optimization - 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings, 2016)

The Recoverable Robust Two-Level Network Design Problem - Eduardo Álvarez-Miranda; Ivana Ljubic; S. Raghavan; Paolo Toth (INFORMS J. Comput., 2015)

A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem - Markus Leitner; Ivana Ljubic; Markus Sinnl (INFORMS J. Comput., 2015)

The Generalized Regenerator Location Problem - Si Chen; Ivana Ljubic; S. Raghavan (INFORMS J. Comput., 2015)

The two-level diameter constrained spanning tree problem - Luis Eduardo Neves Gouveia; Markus Leitner; Ivana Ljubic (Math. Program., 2015)

ILP and CP Formulations for the Lazy Bureaucrat Problem - Fabio Furini; Ivana Ljubic; Markus Sinnl (Integration of AI and OR Techniques in Constraint Programming - 12th International Conference, CPAIOR 2015, Barcelona, Spain, May 18-22, 2015, Proceedings, 2015)

A MIP-based approach to solve the prize-collecting local access network design problem - Ivana Ljubic; Peter Putz; Juan José Salazar González (Eur. J. Oper. Res., 2014)

Hop constrained Steiner trees with multiple root nodes - Luis Eduardo Neves Gouveia; Markus Leitner; Ivana Ljubic (Eur. J. Oper. Res., 2014)

A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs - Markus Leitner; Ivana Ljubic; Martin Luipersbeck; Max Resch (Hybrid Metaheuristics - 9th International Workshop, HM 2014, Hamburg, Germany, June 11-13, 2014. Proceedings, 2014)

On the Asymmetric Connected Facility Location Polytope - Markus Leitner; Ivana Ljubic; Juan José Salazar González; Markus Sinnl (Combinatorial Optimization - Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers, 2014)

A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems - Eduardo Álvarez-Miranda; Ivana Ljubic; Paolo Toth (4OR, 2013)

A cutting plane algorithm for the Capacitated Connected Facility Location Problem - Stefan Gollowitzer; Bernard Gendron; Ivana Ljubic (Comput. Optim. Appl., 2013)

Lagrangian decompositions for the two-level FTTx network design problem - Andreas Bley; Ivana Ljubic; Olaf Maurer (EURO J. Comput. Optim., 2013)

Solving the bi-objective prize-collecting Steiner tree problem with the 1013-constraint method - Markus Leitner; Ivana Ljubic; Markus Sinnl (Electron. Notes Discret. Math., 2013)

Stochastic Survivable Network Design Problems - Ivana Ljubic; Petra Mutzel; Bernd Zey (Electron. Notes Discret. Math., 2013)

On the Two-Architecture Connected Facility Location Problem - Markus Leitner; Ivana Ljubic; Markus Sinnl; Axel Werner (Electron. Notes Discret. Math., 2013)

Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities - Stefan Gollowitzer; Luis Eduardo Neves Gouveia; Ivana Ljubic (Eur. J. Oper. Res., 2013)

Exact approaches for solving robust prize-collecting Steiner tree problems - Eduardo Álvarez-Miranda; Ivana Ljubic; Paolo Toth (Eur. J. Oper. Res., 2013)

Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem - Ivana Ljubic; Stefan Gollowitzer (INFORMS J. Comput., 2013)

The Rooted Maximum Node-Weight Connected Subgraph Problem - Eduardo Álvarez-Miranda; Ivana Ljubic; Petra Mutzel (Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 10th International Conference, CPAIOR 2013, Yorktown Heights, NY, USA, May 18-22, 2013. Proceedings, 2013)

Variable Neighborhood Search for Solving the Balanced Location Problem - Jozef Kratica; Markus Leitner; Ivana Ljubic (Electron. Notes Discret. Math., 2012)

Exact approaches to the single-source network loading problem - Ivana Ljubic; Peter Putz; Juan José Salazar González (Networks, 2012)

On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes - Luis Eduardo Neves Gouveia; Markus Leitner; Ivana Ljubic (Combinatorial Optimization - Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers, 2012)

MIP models for connected facility location: A theoretical and computational study - Stefan Gollowitzer; Ivana Ljubic (Comput. Oper. Res., 2011)

Exact solutions for the robust prize-collecting steiner tree problem - Eduardo Álvarez-Miranda; Ivana Ljubic; Paolo Toth (3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, ICUMT 2011, Budapest, Hungary, October 5-7, 2011, 2011)

A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes - Stefan Gollowitzer; Luis Eduardo Neves Gouveia; Ivana Ljubic (Network Optimization - 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, 2011. Proceedings, 2011)

The Two Level Network Design Problem with Secondary Hop Constraints - Stefan Gollowitzer; Luis Eduardo Neves Gouveia; Ivana Ljubic (Network Optimization - 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, 2011. Proceedings, 2011)

A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem - Ivana Ljubic; Peter Putz; Juan José Salazar González (Network Optimization - 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, 2011. Proceedings, 2011)

MIP Modeling of Incremental Connected Facility Location - Ashwin Arulselvan; Andreas Bley; Stefan Gollowitzer; Ivana Ljubic; Olaf Maurer (Network Optimization - 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, 2011. Proceedings, 2011)

Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs - Ivana Ljubic; Stefan Gollowitzer (Electron. Notes Discret. Math., 2010)

Orientation-based models for {0, 1, 2}-survivable network design: theory and practice - Markus Chimani; Maria Kandyba; Ivana Ljubic; Petra Mutzel (Math. Program., 2010)

The regenerator location problem - Si Chen; Ivana Ljubic; S. Raghavan (Networks, 2010)

A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation - Ivana Ljubic (Networks, 2010)

Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut - Immanuel M. Bomze; Markus Chimani; Michael Jünger; Ivana Ljubic; Petra Mutzel; Bernd Zey (Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I, 2010)

Obtaining optimal k-cardinality trees fast - Markus Chimani; Maria Kandyba; Ivana Ljubic; Petra Mutzel (ACM J. Exp. Algorithmics, 2009)

Obtaining Optimal k-Cardinality Trees Fast - Markus Chimani; Maria Kandyba; Ivana Ljubic; Petra Mutzel (Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, ALENEX 2008, San Francisco, California, USA, January 19, 2008, 2008)

Strong Formulations for 2-Node-Connected Steiner Network Problems - Markus Chimani; Maria Kandyba; Ivana Ljubic; Petra Mutzel (Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings, 2008)

A GRASP Algorithm for the Connected Facility Location Problem - Alessandro Tomazic; Ivana Ljubic (Proceedings of the 2008 International Symposium on Applications and the Internet, SAINT 2008, 28 July - 1 August 2008, Turku, Finland, 2008)

A Hybrid VNS for Connected Facility Location - Ivana Ljubic (Hybrid Metaheuristics, 4th International Workshop, HM 2007, Dortmund, Germany, October 8-9, 2007, Proceedings, 2007)

An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem - Ivana Ljubic; René Weiskircher; Ulrich Pferschy; Gunnar W. Klau; Petra Mutzel; Matteo Fischetti (Math. Program., 2006)

Solving the Prize-Collecting Steiner Tree Problem to Optimality - Ivana Ljubic; René Weiskircher; Ulrich Pferschy; Gunnar W. Klau; Petra Mutzel; Matteo Fischetti (Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, ALENEX /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005, 2005)

Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem - Gunnar W. Klau; Ivana Ljubic; Andreas Moser; Petra Mutzel; Philipp Neuner; Ulrich Pferschy; Günther R. Raidl; René Weiskircher (Genetic and Evolutionary Computation - GECCO 2004, Genetic and Evolutionary Computation Conference, Seattle, WA, USA, June 26-30, 2004, Proceedings, Part I, 2004)

A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs - Ivana Ljubic; Günther R. Raidl (J. Heuristics, 2003)

The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract - Gunnar W. Klau; Ivana Ljubic; Petra Mutzel; Ulrich Pferschy; René Weiskircher (Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings, 2003)

A Genetic Algorithm for the Index Selection Problem - Jozef Kratica; Ivana Ljubic; Dusan Tosic (Applications of Evolutionary Computing, EvoWorkshop 2003: EvoBIO, EvoCOP, EvoIASP, EvoMUSART, EvoROB, and EvoSTIM, Essex, UK, April 14-16, 2003, Proceedings, 2003)

Evolutionary local search for the edge-biconnectivity augmentation problem - Günther R. Raidl; Ivana Ljubic (Inf. Process. Lett., 2002)

A Memetic Algorithm for Vertex-Biconnectivity Augmentation - Sandor Kersting; Günther R. Raidl; Ivana Ljubic (Applications of Evolutionary Computing, EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN, Kinsale, Ireland, April 3-4, 2002, Proceedings, 2002)

Solving the simple plant location problem by genetic algorithm - Jozef Kratica; Dusan Tosic; Vladimir Filipovic; Ivana Ljubic (RAIRO Oper. Res., 2001)

An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem - Ivana Ljubic; Günther R. Raidl (Applications of Evolutionary Computing, EvoWorkshops 2001: EvoCOP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM, Como, Italy, April 18-20, 2001, Proceedings, 2001)

A genetic algorithm for the biconnectivity augmentation problem - Ivana D. Ljubic; Jozef J. Kratica (Proceedings of the 2000 Congress on Evolutionary Computation, CEC 2000, La Jolla, CA, USA, July 16-19, 2000, 2000)

A Hybrid GA for the Edge-Biconnectivity Augmentation Problem - Ivana Ljubic; Günther R. Raidl; Jozef Kratica (Parallel Problem Solving from Nature - PPSN VI, 6th International Conference, Paris, France, September 18-20, 2000, Proceedings, 2000)