Mixed-integer programming (mip) problems combining integer and continuous variables

From MaRDI portal

Solved by branch-and-bound/branch-and-cut, cutting planes, and metaheuristics.

algorithmic task

MaRDI QIDQ6826074FDOCommunityMathAlgoDB





References
An Automatic Method of Solving Discrete Programming Problems
Further links
Item Property
discrete and combinatorial optimization problems specialized by

Edit mixed-integer programming (mip) problems combining integer and continuous variables item


This page was built for task: mixed-integer programming (mip) problems combining integer and continuous variables

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Mixed-integer_programming_(mip)_problems_combining_integer_and_continuous_variables&oldid=55844347"
Powered by MediaWiki