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 …

Having reached the 50th (golden) anniversary of the publication of Kuhn's seminal article on
the solution of the classic assignment problem, it seems useful to take a look at the variety of …

Abstract This paper presents Goal Assignment and Planning: a computationally tractable,
complete algorithm for generating dynamically feasible trajectories for NN interchangeable …

Teams of mobile robots often need to divide up subtasks efficiently. In spatial domains, a key
criterion for doing so may depend on distances between robots and the subtasks' locations …

In this chapter we will focus on models and algorithms for creating fair course timetables. For
this purpose we consider the distribution of the timetable quality over the stakeholders. We …

We consider the problem of fairly allocating a set of m indivisible goods to n agents, given
the agents' utilities for each good. Fair allocations in this context are those maximizing the …

Multi-robot teams that intelligently gather information have the potential to transform
industries as diverse as agriculture, space exploration, mining, environmental monitoring …

This paper addresses the problem of actively controlling robotic teams with range-only
sensors to (a) discover and (b) localize an unknown number of devices. We develop …

The Hierarchical Chinese Postman Problem (HCPP) is a Chinese Postman Problem with the
arcs partitioned into priority classes ordered by a precedence relation. The problem under …

The classic assembly line balancing problem (ALBP) basically consists of assigning a set of
tasks to a group of workstations while maintaining the tasks' precedence relations. When the …