Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
operations_research::sat::BruteForceResult Struct Reference

#include <2d_packing_brute_force.h>

Public Types

enum class  Status { kFoundSolution , kNoSolutionExists , kTooBig }
 

Public Attributes

Status status
 
std::vector< Rectangle > positions_for_solution
 Only non-empty if status==kFoundSolution.
 

Detailed Description

Try to solve the Orthogonal Packing Problem by enumeration of all possible solutions. It will try to preprocess the problem into a smaller one and will only try to solve it if it the reduced problem has max_complexity or less items.

Warning
do not call this with a too many items and a large value of max_complexity or it will run forever.

Definition at line 33 of file 2d_packing_brute_force.h.

Member Enumeration Documentation

◆ Status

Enumerator
kFoundSolution 
kNoSolutionExists 
kTooBig 

Definition at line 34 of file 2d_packing_brute_force.h.

Member Data Documentation

◆ positions_for_solution

std::vector<Rectangle> operations_research::sat::BruteForceResult::positions_for_solution

Only non-empty if status==kFoundSolution.

Definition at line 42 of file 2d_packing_brute_force.h.

◆ status

Status operations_research::sat::BruteForceResult::status

Definition at line 40 of file 2d_packing_brute_force.h.


The documentation for this struct was generated from the following file: