Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Systems Science and Systems Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
