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