The branch-and-bound (B&B) algorithmic framework has been used successfully to find
exact solutions for a wide array of optimization problems. B&B uses a tree search strategy to …

An integer linear program (ILP) is symmetric if its variables can be permuted without
changing the structure of the problem. Areas where symmetric ILPs arise range from applied …

We discuss formulations of integer programs with a huge number of variables and their
solution by column generation methods, ie, implicit pricing of nonbasic variables to generate …

The book is a valuable contribution to the literature, collecting together in a coherent way a
vast amount of work in a fast-growing subject, and bringing the reader right up to date. The …

Dantzig-Wolfe decomposition and column generation, devised for linear programs, is a
success story in large-scale integer programming. We outline and relate the approaches …

Graph colouring is one of those rare examples in the mathematical sciences of a problem
that, while easy to state and visualise, has many aspects that are exceptionally difficult to …

This thesis introduces the novel paradigm of constraint integer programming (CIP), which
integrates constraint programming (CP) and mixed integer programming (MIP) modeling …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

Wireless communication is used in many different situations such as mobile telephony, radio
and TV broadcasting, satellite communication, wireless LANs, and military operations. In …

Redistricting, the redrawing of congressional district boundaries within the states, may occur
every 10 years on the basis of the population census. Many redistricting plans are designed …