Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include "ortools/math_opt/solvers/glop_solver.h"
#include <algorithm>
#include <atomic>
#include <cstdint>
#include <functional>
#include <memory>
#include <string>
#include <vector>
#include "absl/cleanup/cleanup.h"
#include "absl/container/flat_hash_map.h"
#include "absl/log/check.h"
#include "absl/memory/memory.h"
#include "absl/status/status.h"
#include "absl/status/statusor.h"
#include "absl/strings/str_cat.h"
#include "absl/strings/str_join.h"
#include "absl/strings/str_split.h"
#include "absl/strings/string_view.h"
#include "absl/time/clock.h"
#include "absl/time/time.h"
#include "absl/types/span.h"
#include "ortools/base/logging.h"
#include "ortools/base/map_util.h"
#include "ortools/base/protoutil.h"
#include "ortools/base/status_macros.h"
#include "ortools/base/strong_vector.h"
#include "ortools/glop/lp_solver.h"
#include "ortools/glop/parameters.pb.h"
#include "ortools/glop/parameters_validation.h"
#include "ortools/lp_data/lp_data.h"
#include "ortools/lp_data/lp_types.h"
#include "ortools/math_opt/callback.pb.h"
#include "ortools/math_opt/core/inverted_bounds.h"
#include "ortools/math_opt/core/math_opt_proto_utils.h"
#include "ortools/math_opt/core/solver_interface.h"
#include "ortools/math_opt/core/sparse_vector_view.h"
#include "ortools/math_opt/infeasible_subsystem.pb.h"
#include "ortools/math_opt/model.pb.h"
#include "ortools/math_opt/model_parameters.pb.h"
#include "ortools/math_opt/model_update.pb.h"
#include "ortools/math_opt/parameters.pb.h"
#include "ortools/math_opt/result.pb.h"
#include "ortools/math_opt/solution.pb.h"
#include "ortools/math_opt/sparse_containers.pb.h"
#include "ortools/math_opt/validators/callback_validator.h"
#include "ortools/port/proto_utils.h"
#include "ortools/util/logging.h"
#include "ortools/util/solve_interrupter.h"
#include "ortools/util/strong_integers.h"
#include "ortools/util/time_limit.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. | |
Functions | |
template<typename IndexType > | |
void | operations_research::math_opt::UpdateIdIndexMap (glop::StrictITIVector< IndexType, bool > indices_to_delete, IndexType num_indices, absl::flat_hash_map< int64_t, IndexType > &id_index_map) |
template<typename IndexType > | |
SparseDoubleVectorProto | operations_research::math_opt::FillSparseDoubleVector (absl::Span< const int64_t > ids_in_order, const absl::flat_hash_map< int64_t, IndexType > &id_map, const glop::StrictITIVector< IndexType, glop::Fractional > &values, const SparseVectorFilterProto &filter) |
template<typename ValueType > | |
BasisStatusProto | operations_research::math_opt::FromGlopBasisStatus (const ValueType glop_basis_status) |
ValueType should be glop's VariableStatus or ConstraintStatus. | |
template<typename IndexType , typename ValueType > | |
SparseBasisStatusVector | operations_research::math_opt::FillSparseBasisStatusVector (absl::Span< const int64_t > ids_in_order, const absl::flat_hash_map< int64_t, IndexType > &id_map, const glop::StrictITIVector< IndexType, ValueType > &values) |
template<typename ValueType > | |
ValueType | operations_research::math_opt::ToGlopBasisStatus (const BasisStatusProto basis_status) |
ValueType should be glop's VariableStatus or ConstraintStatus. | |
template<typename T > | |
std::vector< int64_t > | operations_research::math_opt::GetSortedIs (const absl::flat_hash_map< int64_t, T > &id_map) |
template<typename T > | |
glop::StrictITIVector< T, int64_t > | operations_research::math_opt::IndexToId (const absl::flat_hash_map< int64_t, T > &id_map) |