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...
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 r...
Presenting a strong and clear relationship between theory and practice, Linear and Integer Optimization: Theory and Practice is divided into two main parts. The first covers the theory of linear and integer optimization, including both basic and advanced topics. Dantzig s simplex algorithm, duality, sensitivity analysis, integer optimization models, and network models are introduced.
More advanced topics also are presented including interior point algorithms, the branch-and-bound algorithm, cutting planes, complexity, standard combinatorial optimization models, the assignment problem,...
Presenting a strong and clear relationship between theory and practice, Linear and Integer Optimization: Theory and Practice is divided into two ma...
