Miscellaneous activities


Attended summer schools, workshops, and conferences (without presentation)

[2001] [2000] [1997] [1996] [1995] 


2001

ConferenceEighth Conference on Integer Programming, Combinatorial Optimization
LocationUtrecht University, Utrecht, The Netherlands
DateJune 13-15, 2001

ConferenceDONET Summer school on Integer, Combinatorial Optimization
LocationUtrecht University, Utrecht, The Netherlands
DateJune 11-12, 2001

ConferenceCEBIT 2001
LocationHannover, Germany
DateMarch, 2001

2000

ConferenceCIRM-DONET workshop on Graph Theory
LocationLevico, Trento, Italy
DateMay 7-12, 2000

1997

ConferenceIPM Workshop
LocationRotterdam, The Netherlands
DateAugust 20, 1997

ConferenceEIDMA Minicourse on Computational Combinatorial Optimization by W. J. Cook
LocationTechnical University Eindhoven, Eindhoven, The Netherlands
DateJune, 1997

ConferenceSymposium on Methods, Algorithms for Radio Channel Assignment
LocationUniversity of Oxford, Oxford, United Kingdom
DateApril 8-10, 1997

1996

ConferenceSummerschool on Approximation Algorithms
LocationBerlin, Germany
DateJune, 1996

ConferenceCombinatorial Optimization 96
LocationLondon, United Kingdom
DateMarch 27-29, 1996

Conference1st Aussois Workshop on Combinatorial Optimization
LocationAussois, France
DateJanuary 8-12, 1996

1995

ConferenceCALMA Symposium
LocationScheveningen, The Netherlands
DateNovember 24, 1995


Referee activities

Over the years I refereed papers for the following journals: Operations Research, Management Science, Mathematical Programming, European Journal of Operational Research, INFORMS Journal on Computing, Discrete Applied Mathematics, Telecommunication Systems, Optimization and Engineering, 4OR, Theoretical Computer Science, Annals of Operations Research, and TOP, Naval Research Logistics, SIAM Journal on Discrete Mathematics (no particular order).

Moreover, I refereed papers for (the proceedings of) conferences like ESA, IPCO, ICC, WAOA, and Proceedings of the INFORMS Telecommunication Conference.

LNMB website

In 1997, Roy Willemen and I have constructed the web-site of the LNMB, the Dutch Network on the Mathematics of Operations Research.

LIFE stock exchange

In 1997, Dennis Bams, Mark Schweitzer, and I have started the LIFE Stock Exchange, an internet-game to predict stock rates.

DualNet

In 1995, I graduated on the software package DualNet. DualNet is a Windows application for solving the minimum cost flow problem. DualNet is made by order of the Departement of Statistics, Probability and Operations Research of the Faculty of Technical Mathematics and Informatics of Delft University of Technology. 

The minimum cost flow problem (also mentioned as network-problem) is a well-known combinatorial optimization problem. The problem can be solved in polynomial time. An example of a min cost flow problem is given by 

Pure Network

This problem is a pure network problem with arcs. You also have generalized network problems, with multipliers at the edges. An example of this problem is given by 

Generalized Network

DualNet solves the problem by the dual simplex method for min cost flow problems. In this method each iterations is O(n), where n is the number of nodes in the network. In the dual simplex method the base of the problem is given by a tree (pure networks) or a collection of quasi-trees (generalized networks). A quasi-tree is a tree plus one more edge. In the program DualNet you can display these trees and the network on the screen in each iterations. If you choose to solve the problem direct, you only can display the network. In the network-window you can click on nodes and edges for more information about the costs, capacities, flow, etc. You also can move nodes in the window, to create your own interpretation of the network. 

A DualNet-software-package (inclusive examples) is available here. DualNet isn't for commercial use. Since, the program starts in Dutch, you should read README.ENG before if you are not familiar with this language. 

For more information mail to: kosterzib.de


Last modified: Tue Feb 15 13:54:30 CET 2005 by Arie Koster