This repository has been archived on 2023-08-20. You can view files and clone it, but cannot push or open issues or pull requests.
yap-6.3/packages/gecode/dev/extractor/xml/group__TaskModelIntBinPacking.xml
Vitor Santos Costa a8eda03305 4.2.1 support
2014-01-22 09:41:47 +00:00

50 lines
3.3 KiB
XML

<?xml version='1.0' encoding='UTF-8' standalone='no'?>
<doxygen xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:noNamespaceSchemaLocation="compound.xsd" version="1.8.6">
<compounddef id="group__TaskModelIntBinPacking" kind="group">
<compoundname>TaskModelIntBinPacking</compoundname>
<title>Bin packing constraints</title>
<sectiondef kind="func">
<memberdef kind="function" id="group__TaskModelIntBinPacking_1ga1a066198d4b99975451156fed5c48914" prot="public" static="no" const="no" explicit="no" inline="no" virt="non-virtual">
<type>GECODE_INT_EXPORT void</type>
<definition>GECODE_INT_EXPORT void Gecode::binpacking</definition>
<argsstring>(Home home, const IntVarArgs &amp;l, const IntVarArgs &amp;b, const IntArgs &amp;s, IntConLevel icl=ICL_DEF)</argsstring>
<name>binpacking</name>
<param>
<type>Home</type>
<declname>home</declname>
</param>
<param>
<type>const IntVarArgs &amp;</type>
<declname>l</declname>
</param>
<param>
<type>const IntVarArgs &amp;</type>
<declname>b</declname>
</param>
<param>
<type>const IntArgs &amp;</type>
<declname>s</declname>
</param>
<param>
<type>IntConLevel</type>
<declname>icl</declname>
<defval>ICL_DEF</defval>
</param>
<briefdescription>
<para>Post propagator for bin packing. </para> </briefdescription>
<detaileddescription>
<para>The variables in <emphasis>l</emphasis> are the loads for each bin, whereas the variables in <emphasis>b</emphasis> define for each item into which bin it is packed. The integer values <emphasis>s</emphasis> define the size of the items.</para><para>It is propagated that for each <formula id="287">$j$</formula> with <formula id="288">$0\leq j&lt;|l|$</formula> the constraint <formula id="289">$l_j=\sum_{0\leq i&lt;|b|\wedge b_i=j}s_i$</formula> holds and that for each <formula id="200">$i$</formula> with <formula id="290">$0\leq i&lt;|b|$</formula> the constraint <formula id="291">$0\leq b_i&lt;|l|$</formula> holds.</para><para>Throws the following exceptions:<itemizedlist>
<listitem><para>Of type <ref refid="classGecode_1_1Int_1_1ArgumentSizeMismatch" kindref="compound">Int::ArgumentSizeMismatch</ref> if <emphasis>b</emphasis> and <emphasis>s</emphasis> are not of the same size.</para></listitem><listitem><para>Of type <ref refid="classGecode_1_1Int_1_1ArgumentSame" kindref="compound">Int::ArgumentSame</ref> if <emphasis>l</emphasis> and <emphasis>b</emphasis> share unassigned variables.</para></listitem><listitem><para>Of type <ref refid="classGecode_1_1Int_1_1OutOfLimits" kindref="compound">Int::OutOfLimits</ref> if <emphasis>s</emphasis> contains a negative number. </para></listitem></itemizedlist>
</para> </detaileddescription>
<inbodydescription>
</inbodydescription>
<location file="/usr/include/gecode/int.hh" line="2491" column="1"/>
</memberdef>
</sectiondef>
<briefdescription>
</briefdescription>
<detaileddescription>
<para>Constraints for modeling bin packing problems. Propagation follows: Paul Shaw. A Constraint for Bin Packing. CP 2004. </para> </detaileddescription>
</compounddef>
</doxygen>