It is well known that hierarchies of mathematical programming formulations with different numbers of variables and constraints have a considerable impact regarding the quality of solutions obtained once these formulations are fed to a commercial solver. In addition, even if dimensions are kept the same, changes in formulations may largely influence solvability and quality of results. This becomes evident especially if redundant constraints are used. We propose a related framework for information collection based on these constraints. We exemplify by means of a well-known combinatorial optimization problem from the knapsack problem family, i.e., the multidimensional multiple-choice knapsack problem (MMKP). This incorporates a relationship of the MMKP to some generalized set partitioning problems. Moreover, we investigate an application in maritime shipping and logistics by means of the dynamic berth allocation problem (DBAP), where optimal solutions are reached from the root node within the solver.