We consider the optimal ship navigation problem wherein the goal is to find the shortest path between two given coordinates in the presence of obstacles subject to safety distance and turn-radius constraints. These obstacles can be debris, rock formations, small islands, ice blocks, other ships,...

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...

The n-step mixed integer rounding (MIR) functions generate n-step MIR inequalities for MIP problems and are facets for the infinite group problems. We show that the n-step MIR functions also directly generate facets for the finite master cyclic group polyhedra especially in many cases where the...