In this paper we investigate the relationship between the nearest point problem in a polyhedral cone and the nearest point problem in a polyhedral set, and use this relationship to devise an effective method for solving the latter using an existing algorithm for the former. We then show that...

The model configuration problem (MCP) is a combinatorial optimization problem with application in the telecommunications manufacturing industry. The product is a switching cabinet, defined by a number of positions (slots) in which specific circuit packs are installed according to the customer...