When a phylogenetic reconstruction does not result in one tree but in several, tree metrics
permit finding out how far the reconstructed trees are from one another. They also permit to …

The paper considers the classic linear assignment problem with a min-sum objective
function, and the most efficient and easily available codes for its solution. We first give a …

When SIAM asked us to prepare a new edition of this book after less than three years from
publication, we expected a light duty. Just the correction of some typos and imprecisions …

revolutionary development which has given mankind the ability to state general goals and to
lay out a path of detailed decisions to take in order to “best” achieve its goals when faced …

XII Preface solution as efficiently as possible. Most of the problems we treat have a good
algorithmic solution, but we also show how even difficult problems can be treated (for …

The maximum cardinality and maximum weight matching problems can be solved in Õ (m√
n) time, a bound that has resisted improvement despite decades of research.(Here m and n …

In this paper, we study inverse optimization problems defined as follows. Let S denote the
set of feasible solutions of an optimization problem P, let c be a specified cost vector, and x 0 …

We study the complexity of finding the values and optimal strategies of mean payoff games
on graphs, a family of perfect information games introduced by Ehrenfeucht and Mycielski …

This paper presents algorithms for the assignment problem, the transportation problem, and
the minimum-cost flow problem of operations research. The algorithms find a minimum-cost …

Linear Assignment Problems and Extensions | SpringerLink Skip to main content
Advertisement Springer Nature Link Account Menu Find a journal Publish with us Track …