Detailed Description

This is used to represent a "special bin packing" problem where we have objects that can either be items with a given demand or bins with a given capacity. The problem is to choose the minimum number of objects that will be bins, such that the other objects (items) can be packed inside.

Definition at line 284 of file routing_cuts.h.

#include <routing_cuts.h>

Public Attributes
int	node = 0
	The initial routing node that correspond to this object.
IntegerValue	demand = 0
IntegerValue	capacity = 0
ItemOrBinType	type = ITEM_OR_BIN

Member Data Documentation

◆ capacity

IntegerValue operations_research::sat::SpecialBinPackingHelper::ItemOrBin::capacity = 0

Definition at line 294 of file routing_cuts.h.

◆ demand

IntegerValue operations_research::sat::SpecialBinPackingHelper::ItemOrBin::demand = 0

Only one option will apply, this can either be an item with given demand or a bin with given capacity.

Important: We support negative demands and negative capacity. We just need that the sum of demand <= capacity for the item in that bin.

Definition at line 293 of file routing_cuts.h.

◆ node

int operations_research::sat::SpecialBinPackingHelper::ItemOrBin::node = 0

The initial routing node that correspond to this object.

Definition at line 286 of file routing_cuts.h.

◆ type

ItemOrBinType operations_research::sat::SpecialBinPackingHelper::ItemOrBin::type = ITEM_OR_BIN

We described the problem where each object can be an item or a bin, but in practice we might have restriction on what object can be which, and we use this field to indicate that.

The numerical order is important as we use that in the greedy algorithm. See ComputeMinNumberOfBins() code.

Definition at line 302 of file routing_cuts.h.

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

ortools/sat/routing_cuts.h