Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include <functional>
#include <memory>
#include "absl/status/statusor.h"
#include "ortools/math_opt/cpp/compute_infeasible_subsystem_arguments.h"
#include "ortools/math_opt/cpp/compute_infeasible_subsystem_result.h"
#include "ortools/math_opt/cpp/incremental_solver.h"
#include "ortools/math_opt/cpp/model.h"
#include "ortools/math_opt/cpp/parameters.h"
#include "ortools/math_opt/cpp/solve_arguments.h"
#include "ortools/math_opt/cpp/solve_result.h"
#include "ortools/math_opt/cpp/solver_init_arguments.h"
#include "ortools/math_opt/cpp/update_result.h"
#include "ortools/math_opt/parameters.pb.h"
Go to the source code of this file.
Namespaces | |
namespace | operations_research |
In SWIG mode, we don't want anything besides these top-level includes. | |
namespace | operations_research::math_opt |
An object oriented wrapper for quadratic constraints in ModelStorage. | |
Typedefs | |
using | operations_research::math_opt::SolveFunction |
Functions | |
absl::StatusOr< SolveResult > | operations_research::math_opt::Solve (const Model &model, const SolverType solver_type, const SolveArguments &solve_args, const SolverInitArguments &init_args) |
absl::StatusOr< ComputeInfeasibleSubsystemResult > | operations_research::math_opt::ComputeInfeasibleSubsystem (const Model &model, const SolverType solver_type, const ComputeInfeasibleSubsystemArguments &compute_args, const SolverInitArguments &init_args) |
absl::StatusOr< std::unique_ptr< IncrementalSolver > > | operations_research::math_opt::NewIncrementalSolver (Model *model, SolverType solver_type, SolverInitArguments arguments) |