Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include <2d_orthogonal_packing.h>
Public Member Functions | |
OrthogonalPackingInfeasibilityDetector (absl::BitGenRef random, SharedStatistics *shared_stats) | |
~OrthogonalPackingInfeasibilityDetector () | |
OrthogonalPackingResult | TestFeasibility (absl::Span< const IntegerValue > sizes_x, absl::Span< const IntegerValue > sizes_y, std::pair< IntegerValue, IntegerValue > bounding_box_size, const OrthogonalPackingOptions &options=OrthogonalPackingOptions()) |
Class for solving the orthogonal packing problem when it can be done efficiently (ie., not applying any heuristic slower than O(N^2)).
Definition at line 134 of file 2d_orthogonal_packing.h.
|
inlineexplicit |
Definition at line 136 of file 2d_orthogonal_packing.h.
operations_research::sat::OrthogonalPackingInfeasibilityDetector::~OrthogonalPackingInfeasibilityDetector | ( | ) |
Definition at line 38 of file 2d_orthogonal_packing.cc.
OrthogonalPackingResult operations_research::sat::OrthogonalPackingInfeasibilityDetector::TestFeasibility | ( | absl::Span< const IntegerValue > | sizes_x, |
absl::Span< const IntegerValue > | sizes_y, | ||
std::pair< IntegerValue, IntegerValue > | bounding_box_size, | ||
const OrthogonalPackingOptions & | options = OrthogonalPackingOptions() ) |
The total area of the items was larger than the area of the box.
Definition at line 824 of file 2d_orthogonal_packing.cc.