A comprehensive introduction to network flows that brings together the classic and the contemporary aspects of the field, and provides an integrative view of theory, algorithms, and applications.Expand

Many optimization problems of practical interest are computationally intractable. Therefore, a practical approach for solving such problems is to employ heuristic (approximation) algorithms that can… Expand

We propose a greedy genetic algorithm for the Quadratic Assignment Problem (QAP), one of the hardest nut in the field of combinatorial optimization.Expand

Efficient implementations of Dijkstra's shortest path algorithm are investigated. A new data structure, called the <italic>radix heap</italic>, is proposed for use in this algorithm. On a network… Expand

In this paper, we study inverse optimization problems defined as follows. LetS denote the set of feasible solutions of an optimization problemP, letc be a specified cost vector, andx0 be a given… Expand

In this paper, we suggest integer programming and network flow-based lower-bounding methods that we obtain using a branch-and-bound algorithm for the WTA problem.Expand

The past few decades have witnessed numerous applications of operations research in logistics, and these applications have resulted in substantial cost savings.Expand