Mauro Dell'Amico

TL;DR: This book provides a comprehensive treatment of assignment problems from their conceptual beginnings in the 1920s through present-day theoretical, algorithmic, and practical developments and can serve as a text for advanced courses in discrete mathematics, integer programming, combinatorial optimization, and algorithmic computer science.

TL;DR: A comprehensive treatment of assignment problems from their conceptual beginnings in the 1920s through present-day theoretical, algorithmic, and practical developments can be found in this article, where the authors have organized the book into 10 self-contained chapters to make it easy for readers to use the specific chapters of interest to them without having to read the book linearly.

TL;DR: This paper applies the tabu-search technique to the job-shop scheduling problem, a notoriously difficult problem in combinatorial optimization and shows that the implementation of this method dominates both a previous approach with tabu search and the other heuristics based on iterative improvements.

TL;DR: Part I: General methodologies complexity and approximability polyhedral combinatorics branch-and-cut algorithms matroids and submodular functions advances in linear programming decomposition and column generation stochastic integer programming randomized algorithms local search graphs and matrices.

TL;DR: Bike sharing systems offer a mobility service whereby public bicycles, located at different stations across an urban area, are available for shared use and contribute towards obtaining a more sustainable mobility and decreasing traffic and pollution caused by car transportation.