Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include "ortools/sat/2d_packing_brute_force.h"
#include <algorithm>
#include <array>
#include <limits>
#include <tuple>
#include <utility>
#include <vector>
#include "absl/container/inlined_vector.h"
#include "absl/log/check.h"
#include "absl/strings/str_cat.h"
#include "absl/types/span.h"
#include "ortools/base/logging.h"
#include "ortools/sat/diffn_util.h"
#include "ortools/sat/integer.h"
#include "ortools/util/bitset.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::sat |
Functions | |
bool | operations_research::sat::Preprocess (absl::Span< PermutableItem > &items, std::pair< IntegerValue, IntegerValue > &bounding_box_size, int max_complexity) |
Exposed for testing. | |
BruteForceResult | operations_research::sat::BruteForceOrthogonalPacking (absl::Span< const IntegerValue > sizes_x, absl::Span< const IntegerValue > sizes_y, std::pair< IntegerValue, IntegerValue > bounding_box_size, int max_complexity) |
Variables | |
static constexpr int | operations_research::sat::kMaxProblemSize = 16 |
bool already_explored |
Definition at line 109 of file 2d_packing_brute_force.cc.
IntegerValue x |
Definition at line 107 of file 2d_packing_brute_force.cc.
IntegerValue y |
Definition at line 108 of file 2d_packing_brute_force.cc.