• Publications
  • Influence
Network flows - theory, algorithms and applications
TLDR
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
  • 6,311
  • 471
  • PDF
Network Flows
TLDR
A flow network is a directed graph G = (V,E) in which each edge (u, v) ∈ E has non-negative capacity c(u,v) ≥ 0. Expand
  • 985
  • 73
  • PDF
A survey of very large-scale neighborhood search techniques
Many optimization problems of practical interest are computationally intractable. Therefore, a practical approach for solving such problems is to employ heuristic (approximation) algorithms that canExpand
  • 622
  • 40
  • PDF
A greedy genetic algorithm for the quadratic assignment problem
TLDR
We propose a greedy genetic algorithm for the Quadratic Assignment Problem (QAP), one of the hardest nut in the field of combinatorial optimization. Expand
  • 356
  • 30
  • PDF
Faster algorithms for the shortest path problem
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 networkExpand
  • 491
  • 22
  • PDF
Inverse Optimization
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 givenExpand
  • 355
  • 20
  • PDF
A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
TLDR
We present a very large-scale neighborhood (VLSN) search algorithm for the capacitated facility location problem with single-source constraints. Expand
  • 119
  • 20
  • PDF
A Column Generation Approach to Radiation Therapy Treatment Planning Using Aperture Modulation
TLDR
This paper considers the problem of radiation therapy treatment planning for cancer patients. Expand
  • 150
  • 14
  • PDF
Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem
TLDR
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
  • 163
  • 14
  • PDF
Network Models in Railroad Planning and Scheduling
TLDR
The past few decades have witnessed numerous applications of operations research in logistics, and these applications have resulted in substantial cost savings. Expand
  • 74
  • 13