We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.

Random graphs

Introduction to linear and nonlinear programming

Initial-value ordinary differential equation solution via variable order Adams method (SIVA/DIVA) package is collection of subroutines for solution of nonstiff ordinary differential equations. There are versions for single-precision and double-precision arithmetic. Requires fewer evaluations of derivatives than other variable-order Adams predictor/ corrector methods. Option for direct integration of second-order equations makes integration of trajectory problems significantly more efficient. Written in FORTRAN 77.

Solving Ordinary Differential Equations

http://romisatriawahono.net/lecture/rm/survey/softcomputing/Boussaid%20-%20Optimization%20Metaheuristics%20-%202013.pdf

A survey on optimization metaheuristics

高等学校計算数学学報 = Numerical mathematics

Interactive resource planning is an increasingly important aspect of emission trading markets. The conferences of Rio de Janeiro, 1992, and Kyoto, 1997, originally focusing on environmental protection at both macro- and micro-economic levels, called for new economic instruments of this kind. An important economic tool in this area is Joint Implementation (JI), defined in Article 6 of the Kyoto Protocol. Sustainable development can be guaranteed only if JI is embedded in optimal energy management. In this contribution we describe and evaluate one international procedure within uncertain markets which helps to establish optimal energy management and interactive resource planning processes within uncertain emission trading markets.

The impact of uncertain emission trading markets on interactive resource planning processes and international emission trading experiments

Analysis of the Definitions of Resilience

Contracting has a significant impact on the efficiency of acquisition processes, especially in the context of so-called public–private partnership (PPP) projects. Improperly drafted contracts may cause significant time and cost overruns in project execution due to opportunistic behaviour of private-sector suppliers. The main objective of our paper is to give a better understanding of opportunistic behaviour in PPP projects. The focus is on analysing the effects of delay penalties on the duration of such projects. We developed a system dynamics model, which depicts the complex relationship between the different aspects of a PPP project. In combination with this model, we present a web tool for conducting web-based experiments, which offers the possibility to track the decisions made by the private-sector suppliers during the progress of a simulated project. Using this web tool our experimental pilot study shows that carefully designed contracts help to keep the projects on schedule and bring benefits to both governmental entities and the private-sector suppliers.

Concept and prototype of a web tool for public–private project contracting based on a system dynamics model

In this paper we extend the dynamic programming technique for the multiobjective version of a special class of problems representing a graph-theoretic structure on a certain network We assume that the dynamics of the system is controlled by p actors (players) and each of them intend to minimize his own integral-time cost which is described by a certain trajectory Applying Nash and Pareto optimality principles we study the multiobjective control problems on dynamic networks where the dynamics is described by a directed graph Polynomial-time algorithms for determining the optimal strategies of the players in the considered multiobjective control problems are proposed exploiting the special structure of the underlying graph

A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks

This paper introduces a new coordination method to intercept a mobile target in urban areas with a team of sensor platforms. The task is to intercept the target before it leaves the area. The approach combines algorithmic concepts from ant colony and particle swarm optimization in order to bias the search and to spread the team in the search area. The algorithms introduced are tested in simulation experiments on grids. The success probabilities measured are relatively high for most parameter combinations, and the target is intercepted in roughly half the simulation time on average. Furthermore, the experiments reveal robust behavior with regard to the parameter setting.

/pdf/intercepting-a-target-with-sensor-swarms-2sgjfvkt4m.pdf

Stefan Pickl

Papers

The impact of uncertain emission trading markets on interactive resource planning processes and international emission trading experiments

Analysis of the Definitions of Resilience

Concept and prototype of a web tool for public–private project contracting based on a system dynamics model

A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks

Intercepting a Target with Sensor Swarms