Microgrid control in isolated mode is a highly important subject area. In the present paper, a new method is used for controlling the isolated microgrids. This method was used based on the classification of the microgrids into two groups, namely fast-dynamic (battery and flywheel) and slow-dynamic (diesel generator, electrolyzer, fuel cell). For the microgrid components with fast dynamics, a se...

We present an algorithm to compute a complete set of efficient solutions for the biobjective integer minimum cost flow problem. We use the two phase method with a parametric network simplex algorithm in phase 1 to compute all supported non-dominated extreme points. In phase 2, the remaining nondominated points (non-extreme supported and non-supported) are computed using a k best flow algorithm ...

Finding wirelength optimal packings of rectangles is a well known problem in VLSI design. We propose a branch and bound algorithm for this problem that is based on the rectangle packing algorithm of Moffitt and Pollack. It makes use of a very efficient implementation of an incremental network simplex algorithm. Our algorithm allows for the first time to find optimum solutions of three instances...

To meet wide expectation and growing demand of mobile users, operators have started to deploy different overlapping radio access network technologies. In heterogonous overlaid networks, network selection decision is delegated to mobile users to avoid processing and signaling overhead. In user centric network selection, users select the network selfishly to maximize their utility and cause undes...

In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes.