International Journal of Pure & Applied Mathematical Research

International Journal of Pure & Applied Mathematical Research

Online ISSN : 2456-7493

Frequency : Half Yearly

Current Issue : Volume 1 , Issue 1
2017

HISTORY OF COMBINATORIAL OPTIMIZATION: STUDY OF AN APPLICATION BASED NETWORK FLOWS

Dr. Mohd. Rizwanullah

Associate Professor, Dept. of Mathematics and Statistics,  Manipal University Jaipur, Rajasthan, India.

DOI : Page No : 36-41

Published Online : 2017-06-30

Download Full Article : PDF Check for Updates


Abstract - Combinatorics is a branch of pure mathematics concerning the study of discrete (and usually finite) objects. Combinatorial theory (or combinatorial analysis) is concerned with problems of enumeration and structure of mathematical objects. The objects may represent physical situation or things in applications or may be purely abstract and under study for theoretical reason. It is common practice to refer to the subject matter of combinatorial theory as combinatorics. The availability of reliable software, extremely fast and inexpensive hardware This paper highlights the historical development of combinatorial Optimization techniques specially focuses on network optimization techniques and then describes some very exciting future opportunities.

 

Keywords: Stochastic, Heuristics, Network flow, Max flow, Optimization, Combinatorics, Shortest Path, Extremal,

Int. J.of Pure & App Math. Res.