Generated on Tue Apr 18 10:22:30 2017 for Gecode by doxygen 1.6.3

bin-packing.hh File Reference

(Revision: 15160)

#include <gecode/int.hh>
#include <gecode/int/bin-packing/propagate.hpp>
#include <gecode/int/bin-packing/conflict-graph.hpp>

Go to the source code of this file.


class  Gecode::Int::BinPacking::Item
 Item combining bin and size information. More...
class  Gecode::Int::BinPacking::SizeSet
 Size sets. More...
class  Gecode::Int::BinPacking::SizeSetMinusOne
 Size sets with one element discarded. More...
class  Gecode::Int::BinPacking::Pack
 Bin-packing propagator. More...
class  Gecode::Int::BinPacking::ConflictGraph
 Graph containing conflict information. More...
class  Gecode::Int::BinPacking::ConflictGraph::NodeSet
 Sets of graph nodes. More...
class  Gecode::Int::BinPacking::ConflictGraph::Node
 Class for node in graph. More...
class  Gecode::Int::BinPacking::ConflictGraph::Nodes
 Iterator over node sets. More...
class  Gecode::Int::BinPacking::ConflictGraph::Clique
 Clique information. More...


namespace  Gecode::Int::BinPacking

Bin-packing propagators

namespace  Gecode

Gecode toplevel namespace

namespace  Gecode::Int

Finite domain integers.


bool Gecode::Int::BinPacking::same (const Item &i, const Item &j)
 Whether two items are the same.
bool Gecode::Int::BinPacking::before (const Item &i, const Item &j)
 Test whether one item is before another.
bool Gecode::Int::BinPacking::operator< (const Item &i, const Item &j)
 For sorting according to size.