Get desktop application:
View/edit binary Protocol Buffers messages
Used in:
Optional name. This is only used for display/debugging purposes.
Resource usages for this item. All usages must be non-negative. Should be the same size as resource_capacity in the VectorBinPackingProblem.
Number of identical copies of this item that must be packed into some bin.
The number of extra copies which may be skipped for a penalty. Currently only supported by the ArcFlow solver (arc_flow_solver.h), other solvers ignore this field.
An optional upper bound on how many copies of the same item are allowed in a single bin, regardless of resource utilization. A value of 0 is interpreted as no limit.
Minimize the total cost of bins plus this penalty for each optional copy not placed in any bin. Currently only supported by the ArcFlow solver (arc_flow_solver.h), other solvers ignore this field.
Describe one filled bin in the solution.
Used in:
Which items are in this bin. They are supposed to be unique.
How many of each items are in this bins.
Optional name.
Max capacity of each resource. All bins have the same resource capacities.
Resources names. This can either be left empty or must be of the same size as resource_capacity.
The list of items which are to be assigned to bins.
The maximum number of bins available. A value of 0 is interpreted as no limit. Nonzero values may be used to encode feasibility problems.
If specified, tries to maximize the value of packed items minus the cost per bin used. A missing value is treated as 1. Currently only supported by the ArcFlow solver (ortools/packing/arc_flow_solver.h), other solvers ignore this field.
Optional info from the solver.
Filled bins.
Solve status.
Objective value. The total cost of bins used plus the penalty for any skipped items.
Solve time in seconds.
Time to create the Arc-Flow graph.
Solve status
Used in:
Default state.
The optimal solution was found and proven.
A feasible solution has been found.
The problem is infeasible.