A feasible path-based branch and bound algorithm for strongly nonconvex MINLP problems

Computer Science

• Branch-and-Bound Algorithm 100%
• Nonlinear Programming 50%
• Algorithms 33%
• Mathematical Optimization 33%
• Branch-and-Bound Algorithm Design 33%
• And-States 16%
• Process Intensification 16%
• Models 16%
• Computational Efficiency 16%
• Initialization Procedure 16%
• Process Synthesis 16%
• Simulation Process 16%
• Convergence 16%
• Relaxation Time 16%

Engineering

• Algorithm 100%
• Hybrid 33%
• Optimization 33%
• Subproblem 33%
• Child Node 16%
• Models 16%
• Parent Node 16%
• Integration 16%
• Main Advantage 16%
• Process Simulation 16%
• Initialization 16%
• Relaxation Time 16%
• Nodes 16%
• Computational Efficiency 16%