Complexity of branch-and-bound and cutting planes in mixed-integer optimization
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
Topics & Concepts
MathematicsCutting-plane methodInteger (computer science)Dimension (graph theory)CombinatoricsUpper and lower boundsInteger programmingConstant (computer programming)Branch and cutVariable (mathematics)Regular polygonSet (abstract data type)Nonlinear programmingDiscrete mathematicsPlane (geometry)Optimization problemPolynomialMathematical optimizationNonlinear systemGeometryMathematical analysisComputer sciencePhysicsQuantum mechanicsProgramming languageComplexity and Algorithms in GraphsAdvanced Graph Theory ResearchOptimization and Packing Problems