Diptesh Ghosh – författare

One of the most well-known of all network optimization problems is the shortest path problem, where a shortest connection between two locations in a road network is to be found. This problem is the basis of route planners in vehicles and on the Internet. Networks are very common structures; they consist primarily of a ?nite number of locations (points, nodes), together with a number of links (edges, arcs, connections) between the locations. Very often a certain number is attached to the links, expressing the distance or the cost between the end points of that connection. Networks occur in an extremely wide range of applications, among them are: road networks; cable networks; human relations networks; project scheduling networks; production networks; distribution networks; neural networks; networks of atoms in molecules. In all these cases there are “objects” and “relations” between the objects. A n- work optimization problem is actually nothing else than the problem of ?nding a subset of the objects and the relations, such that a certain optimization objective is satis?ed.

One of the most well-known of all network optimization problems is the shortest path problem, where a shortest connection between two locations in a road network is to be found. This problem is the basis of route planners in vehicles and on the Internet. Networks are very common structures; they consist primarily of a ?nite number of locations (points, nodes), together with a number of links (edges, arcs, connections) between the locations. Very often a certain number is attached to the links, expressing the distance or the cost between the end points of that connection. Networks occur in an extremely wide range of applications, among them are: road networks; cable networks; human relations networks; project scheduling networks; production networks; distribution networks; neural networks; networks of atoms in molecules. In all these cases there are “objects” and “relations” between the objects. A n- work optimization problem is actually nothing else than the problem of ?nding a subset of the objects and the relations, such that a certain optimization objective is satis?ed.

This edited volume is an in-depth collation of the usage of different quantitative decision making techniques in practical areas such as lean & green supply chain, reverse logistics, perishable logistics, closed loop supply chain, sustainable project management, retail management, block chain applications, optimal supplier selection problem, demand/supply modelling, forecasting under uncertainties, scheduling & sequencing, resource constraint logistics, dynamic network supply chain, risk evaluation, and so on. Additionally, the book also solves these issues in theoretical and practical context using innovative mathematical tools. Consisting of selected papers from the 23rd Annual International Conference of the Society of Operations Management, this book's highlight is not only the coverage of interesting topics, but also how these topics are dealt with, such that post-graduate students as well as researchers and industry personnel working in areas like engineering, economics, social sciences, management, mathematics, etc., can derive the maximum benefit by reading or referring to this book. Apart from the emphasis on new mathematical, operations research, operations management, and statistical techniques, the authors also ensure that all the concepts are made clear by highlighting their practical significance in different areas of applications of operations management. By using novel presentation methods, the book offers a good practical flavor of all the different topics relevant to operations management in the coming decades.