Added

Author: chschulte

doc/6.2.0/MPG.7z

@@ -0,0 +1,48 @@
+@InCollection{MPG:M:6.2.0,
+   Author =    "Christian Schulte and Guido Tack and Mikael Z. Lagerkvist",
+   Title =     "Modeling",
+   Editor =    "Christian Schulte and Guido Tack and Mikael Z. Lagerkvist",
+   Booktitle = "Modeling and Programming with Gecode",
+   Year =      2019,
+   Note =      "Corresponds to Gecode 6.2.0",
+}
+@InCollection{MPG:C:6.2.0,
+   Author =    "Christian Schulte and Guido Tack and Mikael Z. Lagerkvist",
+   Title =     "Case studies",
+   Editor =    "Christian Schulte and Guido Tack and Mikael Z. Lagerkvist",
+   Booktitle = "Modeling and Programming with Gecode",
+   Year =      2019,
+   Note =      "Corresponds to Gecode 6.2.0",
+}
+@InCollection{MPG:P:6.2.0,
+   Author =    "Christian Schulte and Guido Tack",
+   Title =     "Programming propagators",
+   Editor =    "Christian Schulte and Guido Tack and Mikael Z. Lagerkvist",
+   Booktitle = "Modeling and Programming with Gecode",
+   Year =      2019,
+   Note =      "Corresponds to Gecode 6.2.0",
+}
+@InCollection{MPG:B:6.2.0,
+   Author =    "Christian Schulte",
+   Title =     "Programming branchers",
+   Editor =    "Christian Schulte and Guido Tack and Mikael Z. Lagerkvist",
+   Booktitle = "Modeling and Programming with Gecode",
+   Year =      2019,
+   Note =      "Corresponds to Gecode 6.2.0",
+}
+@InCollection{MPG:V:6.2.0,
+   Author =    "Christian Schulte",
+   Title =     "Programming variables",
+   Editor =    "Christian Schulte and Guido Tack and Mikael Z. Lagerkvist",
+   Booktitle = "Modeling and Programming with Gecode",
+   Year =      2019,
+   Note =      "Corresponds to Gecode 6.2.0",
+}
+@InCollection{MPG:S:6.2.0,
+   Author =    "Christian Schulte",
+   Title =     "Programming search engines",
+   Editor =    "Christian Schulte and Guido Tack and Mikael Z. Lagerkvist",
+   Booktitle = "Modeling and Programming with Gecode",
+   Year =      2019,
+   Note =      "Corresponds to Gecode 6.2.0",
+}

doc/6.2.0/MPG.bib

@@ -0,0 +1,50 @@
+/*
+ *  Authors:
+ *    Christian Schulte <[email protected]>
+ *
+ *  Copyright:
+ *    Christian Schulte, 2008-2019
+ *
+ *  Permission is hereby granted, free of charge, to any person obtaining
+ *  a copy of this software, to deal in the software without restriction,
+ *  including without limitation the rights to use, copy, modify, merge,
+ *  publish, distribute, sublicense, and/or sell copies of the software,
+ *  and to permit persons to whom the software is furnished to do so, subject
+ *  to the following conditions:
+ *
+ *  The above copyright notice and this permission notice shall be
+ *  included in all copies or substantial portions of the software.
+ *
+ *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+ *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+ *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+ *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+ *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+ *
+ */
+
+class BoolDomExpr : public BoolExpr::Misc {
+protected:
+  IntVar x; int l, u;
+public:
+  BoolDomExpr(IntVar x0, int l0, int u0)
+    : x(x0), l(l0), u(u0) {}
+  // post member function
+  virtual void post(Home home, BoolVar b, bool neg,
+                    IntPropLevel ipl) {
+    if (neg) {
+      const int nlu[2][2] = { { Int::Limits::min, l-1 },
+                              { u+1, Int::Limits::max } };
+      dom(home, x, IntSet(nlu,2), b);
+    } else {
+      dom(home, x, l, u, b);
+    }
+  }
+  virtual ~ReDomExpr(void) {}
+};
+// create Boolean domain expression
+BoolExpr dom(IntVar x, int l, int u) {
+  return BoolExpr(new BoolDomExpr(x,l,u));
+}

doc/6.2.0/MPG.pdf

@@ -0,0 +1,98 @@
+/*
+ *  Authors:
+ *    Christian Schulte <[email protected]>
+ *
+ *  Copyright:
+ *    Christian Schulte, 2008-2019
+ *
+ *  Permission is hereby granted, free of charge, to any person obtaining
+ *  a copy of this software, to deal in the software without restriction,
+ *  including without limitation the rights to use, copy, modify, merge,
+ *  publish, distribute, sublicense, and/or sell copies of the software,
+ *  and to permit persons to whom the software is furnished to do so, subject
+ *  to the following conditions:
+ *
+ *  The above copyright notice and this permission notice shall be
+ *  included in all copies or substantial portions of the software.
+ *
+ *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+ *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+ *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+ *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+ *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+ *
+ */
+
+#include <gecode/int.hh>
+
+using namespace Gecode;
+
+class AssignMin : public Brancher {
+protected:
+  ViewArray<Int::IntView> x;
+  mutable int start;
+  class PosVal : public Choice {
+  public:
+    int pos; int val;
+    PosVal(const AssignMin& b, int p, int v)
+      : Choice(b,1), pos(p), val(v) {}
+    virtual void archive(Archive& e) const {
+      Choice::archive(e);
+      e << pos << val;
+    }
+  };
+public:
+  AssignMin(Home home, ViewArray<Int::IntView>& x0)
+    : Brancher(home), x(x0), start(0) {}
+  static void post(Home home, ViewArray<Int::IntView>& x) {
+    (void) new (home) AssignMin(home,x);
+  }
+  virtual size_t dispose(Space& home) {
+    (void) Brancher::dispose(home);
+    return sizeof(*this);
+  }
+  AssignMin(Space& home, AssignMin& b)
+    : Brancher(home,b), start(b.start) {
+    x.update(home,b.x);
+  }
+  virtual Brancher* copy(Space& home) {
+    return new (home) AssignMin(home,*this);
+  }
+  virtual bool status(const Space& home) const {
+    for (int i=start; i<x.size(); i++)
+      if (!x[i].assigned()) {
+        start = i; return true;
+      }
+    return false;
+  }
+  virtual Choice* choice(Space& home) {
+    return new PosVal(*this,start,x[start].min());
+  }
+  virtual Choice* choice(const Space&, Archive& e) {
+    int pos, val;
+    e >> pos >> val;
+    return new PosVal(*this, pos, val);
+  }
+  virtual ExecStatus commit(Space& home, 
+                            const Choice& c,
+                            unsigned int a) {
+    const PosVal& pv = static_cast<const PosVal&>(c);
+    int pos=pv.pos, val=pv.val;
+    return me_failed(x[pos].eq(home,val)) ? ES_FAILED : ES_OK;
+  }
+  virtual void print(const Space& home, const Choice& c,
+                     unsigned int a,
+                     std::ostream& o) const {
+    const PosVal& pv = static_cast<const PosVal&>(c);
+    int pos=pv.pos, val=pv.val;
+    o << "x[" << pos << "] = " << val;
+  }
+};
+
+void assignmin(Home home, const IntVarArgs& x) {
+  if (home.failed()) return;
+  ViewArray<Int::IntView> y(home,x);
+  AssignMin::post(home,y);
+}

doc/6.2.0/MPG.tar.gz

@@ -0,0 +1,91 @@
+/*
+ *  Authors:
+ *    Christian Schulte <[email protected]>
+ *
+ *  Copyright:
+ *    Christian Schulte, 2008-2019
+ *
+ *  Permission is hereby granted, free of charge, to any person obtaining
+ *  a copy of this software, to deal in the software without restriction,
+ *  including without limitation the rights to use, copy, modify, merge,
+ *  publish, distribute, sublicense, and/or sell copies of the software,
+ *  and to permit persons to whom the software is furnished to do so, subject
+ *  to the following conditions:
+ *
+ *  The above copyright notice and this permission notice shall be
+ *  included in all copies or substantial portions of the software.
+ *
+ *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+ *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+ *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+ *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+ *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+ *
+ */
+
+#include <gecode/kernel.hh>
+
+using namespace Gecode;
+
+class Edge {
+protected:
+  Edge* p;
+  const Choice* ch;
+  unsigned int a;
+public:
+  Edge(Space* s, Edge* e)
+    : p(e), ch(s->choice()), a(0) {}
+  void next(void) {
+    a++;
+  }
+  Space* commit(Space* s) const {
+    s->commit(*ch,a); return s;
+  }
+  Space* recompute(Space* r) const {
+    return commit((p == NULL) ? r->clone() : p->recompute(r));
+  }
+  ~Edge(void) {
+    delete ch;
+  }
+};
+
+void bab(Space* s, Space*& r, Space*& b, Edge* p) {
+  switch (s->status()) {
+  case SS_FAILED:
+    delete s; break;
+  case SS_SOLVED:
+    // solved
+    delete b; 
+    (void) s->choice(); b = s->clone(); delete s;
+    r->constrain(*b);
+    if (r->status() == SS_FAILED) {
+      delete r; r = NULL;
+    } else {
+      Space* c = r->clone(); delete r; r = c;
+    }
+    break;
+  case SS_BRANCH:
+    {
+      Edge e(s,p);
+      bab(e.commit(s),r,b,&e);
+      e.next();
+      // explore second alternative
+      if (r != NULL)
+        bab(e.recompute(r),r,b,&e);
+    }
+  }
+}
+
+Space* bab(Space* s) {
+  if (s->status() == SS_FAILED) {
+    delete s; return NULL;
+  }
+  Space* r = s->clone();
+  Space* b = NULL;
+  bab(s,r,b,NULL);
+  (void) b->choice();
+  delete r;
+  return b;
+}

doc/6.2.0/MPG/Boolean-domain-expression.cpp

@@ -0,0 +1,68 @@
+/*
+ *  Authors:
+ *    Christian Schulte <[email protected]>
+ *
+ *  Copyright:
+ *    Christian Schulte, 2008-2019
+ *
+ *  Permission is hereby granted, free of charge, to any person obtaining
+ *  a copy of this software, to deal in the software without restriction,
+ *  including without limitation the rights to use, copy, modify, merge,
+ *  publish, distribute, sublicense, and/or sell copies of the software,
+ *  and to permit persons to whom the software is furnished to do so, subject
+ *  to the following conditions:
+ *
+ *  The above copyright notice and this permission notice shall be
+ *  included in all copies or substantial portions of the software.
+ *
+ *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+ *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+ *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+ *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+ *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+ *
+ */
+
+#include <gecode/kernel.hh>
+
+using namespace Gecode;
+
+void bab(Space* s, unsigned int& n, Space*& b) {
+  switch (s->status()) {
+  case SS_FAILED:
+    delete s;
+    break;
+  case SS_SOLVED:
+    // solved
+    n++;
+    delete b; 
+    (void) s->choice(); b = s->clone(); delete s;
+    break;
+  case SS_BRANCH:
+    {
+      const Choice* ch = s->choice();
+      Space* c = s->clone();
+      // remember number of solutions
+      unsigned int m=n;
+      // explore first alternative
+      s->commit(*ch,0);
+      bab(s,n,b);
+      // constrain clone
+      if (n > m)
+        c->constrain(*b);
+      // explore second alternative
+      c->commit(*ch,1);
+      bab(c,n,b);
+      delete ch;
+    }
+    break;
+  }
+}
+
+Space* bab(Space* s) {
+  unsigned int n = 0; Space* b = NULL;
+  bab(s,n,b);
+  return b;
+}