Warehouse location problem (WLP) is a variant of the well known facility location problem. It is about taking a decision to choose warehouses amongst a set of known locations between plants and markets, such that total cost of location and transportation is minimized. WLP is formulated as Mixed Integer Programming (MIP) problem. Three variants of WLP have been attempted in this work by varying the capacity considerations and changing the warehouse echelons. These variants are Single Stage Uncapacitated Warehouse Location Problem (SSUWLP), Single Stage Capacitated Warehouse Location Problem (SSCWLP), and Two Stage Capacitated Warehouse Location Problem (TSCWLP). These variants being NP-hard, obtaining optimal solution in practical time is difficult. The book aims to derive better method to attempt these problems by developing new solution approaches and better relaxations, which are used in branch-and-bound to get the optimal solution. The computational experiences of a large variety of small and large problems are analyzed. A key features of this work is an extensively studied literature of WLP. This book should help those who are working in the location problems or MIP problems.