Article Sidebar
Published:
Mar 20, 2013Keywords:
absorbing Markov chain educational system graph theory network design
Article Details
Issue
Section
Articles
Copyright of the journal's content belongs to Kwame Nkrumah University of Science and Technology, Kumasi, Ghana.
The copyright of a submitted article is only transferred to the publishers if and when the article is accepted for publication. All rights reserved. No part of this publication may be reproduced, stored in a retrieval system or transmitted in any form or by any means, electronic, electrostatic, mechanical, photocopying, recording or otherwise without the prior written permission of the publishers.
The copyright of a submitted article is only transferred to the publishers if and when the article is accepted for publication. All rights reserved. No part of this publication may be reproduced, stored in a retrieval system or transmitted in any form or by any means, electronic, electrostatic, mechanical, photocopying, recording or otherwise without the prior written permission of the publishers.
Main Article Content
A Note on the Art of Network Design Problems
Abstract
In this study, we describe some Network Design Problems (NDPs) as well as the network flowbased improvement algorithm for neighbourhood search defined by cycles. The main part of the study is structured around the formulation of the expected duration of stay in the educational system as a NDP. The fundamental matrix of the absorbing Markov chain is employed in computing the expected duration of each flow in the system. We shall illustrate the new graphtheoretic formulation for the educational system using datasets from a university setting. The paper concludes with suggestions for future directions of research.
Keywords: absorbing Markov chain; educational system; graph theory; network design.
