|
Minotaur 0.4.1
Docs for developers
|

Files | |
| Bnb.cpp | |
| The Bnb class for solving instances in mps or ampl format (.nl) by using Branch-and-Bound alone. | |
| Bnb.h | |
| Define the Bnb class. | |
| BnbDistPar.cpp | |
| The main function for solving instances in ampl format (.nl) by using a distributed parallel implementation of Branch-and-Bound. | |
| BnbDistPar.h | |
| Define the BnbDistPar class. | |
| BnbDistParMain.cpp | |
| The main function for solving instances by distributed parallel Branch-and-Bound (Bnb) algorithm. | |
| BnbMain.cpp | |
| The main function for solving instances by Branch-and-Bound. | |
| BnbPar.cpp | |
| The main function for solving instances in ampl format (.nl) by using a parallel implementation of Branch-and-Bound. | |
| BnbPar.h | |
| Define the BnbPar class. | |
| BnbParMain.cpp | |
| The main function for solving instances by parallel Branch-and-Bound (Bnb) algorithm. | |
| Glob.cpp | |
| The Glob class for solving MIQCQP instances using ampl (.nl) format. | |
| Glob.h | |
| The Glob class for solving MIQCQP instances using ampl (.nl) format. | |
| GlobMain.cpp | |
| The main function for solving instances with glob. | |
| MsBnb.cpp | |
| The main function for solving instances in ampl format (.nl) by using multistart Branch-and-estimate heuristic. | |
| MultiStart.cpp | |
| The class for solving nonconvex problems using multistart Branch-and-estimate heuristic. | |
| MultiStart.h | |
| Define the MultiStart class. | |
| MultiStartMain.cpp | |
| The main function for solving instances by a multi-start heuristic. | |
| QG.cpp | |
| Define class for Quesada-Grossmann (QG) algorithm for solving MINLPs. | |
| QG.h | |
| Define the QG class. | |
| QGMain.cpp | |
| The main function for solving instances by Quesada-Grossmann (QG) algorithm. | |
| QGPar.cpp | |
| The main function for solving instances in ampl format (.nl) by using a parallel implementation of Advanced Quesada-Grossmann (QG) algorithm for solving convex MINLPs. | |
| QGPar.h | |
| Define the QGPar class. | |
| QGParMain.cpp | |
| The main function for solving instances by Quesada-Grossmann (QG) algorithm. | |
| SolCheck.cpp | |
| Given a solution file and a problem file, checks whether is solution is feasible to the problem. | |
| SolCheck.h | |
| SolCheck class for checking feasibility of a solution. | |
| Solver.cpp | |
| Define base class Solver. | |
| Solver.h | |
| Define the abstract base class Solver. | |