stress-min.cpp
Go to the documentation of this file.00001 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ 00002 /* 00003 * Main authors: 00004 * Christian Schulte <schulte@gecode.org> 00005 * 00006 * Copyright: 00007 * Christian Schulte, 2004 00008 * 00009 * Last modified: 00010 * $Date: 2009-05-14 00:24:31 +0200 (Thu, 14 May 2009) $ by $Author: tack $ 00011 * $Revision: 9095 $ 00012 * 00013 * This file is part of Gecode, the generic constraint 00014 * development environment: 00015 * http://www.gecode.org 00016 * 00017 * Permission is hereby granted, free of charge, to any person obtaining 00018 * a copy of this software and associated documentation files (the 00019 * "Software"), to deal in the Software without restriction, including 00020 * without limitation the rights to use, copy, modify, merge, publish, 00021 * distribute, sublicense, and/or sell copies of the Software, and to 00022 * permit persons to whom the Software is furnished to do so, subject to 00023 * the following conditions: 00024 * 00025 * The above copyright notice and this permission notice shall be 00026 * included in all copies or substantial portions of the Software. 00027 * 00028 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 00029 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 00030 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 00031 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 00032 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 00033 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 00034 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 00035 * 00036 */ 00037 00038 #include <gecode/driver.hh> 00039 #include <gecode/int.hh> 00040 00041 using namespace Gecode; 00042 00049 class StressMin : public Script { 00050 protected: 00052 const int n; 00054 IntVarArray x; 00055 public: 00057 StressMin(const SizeOptions& opt) 00058 : n(opt.size()), x(*this,n,0,2*n-1) { 00059 for (int i=1; i<n; i++) { 00060 IntVarArgs y(i); 00061 for (int j=0; j<i; j++) 00062 y[j]=x[j]; 00063 IntVar m(*this,0,2*n); 00064 min(*this, y, m); 00065 rel(*this, m, IRT_GR, x[i]); 00066 } 00067 branch(*this, x, INT_VAR_NONE, INT_VAL_SPLIT_MAX); 00068 } 00069 00071 StressMin(bool share, StressMin& s) : Script(share,s), n(s.n) { 00072 x.update(*this, share, s.x); 00073 } 00074 00076 virtual Space* 00077 copy(bool share) { 00078 return new StressMin(share,*this); 00079 } 00080 00082 virtual void 00083 print(std::ostream& os) const { 00084 os << "\tx[" << n << "] = " << x << std::endl; 00085 } 00086 }; 00087 00088 00092 int 00093 main(int argc, char* argv[]) { 00094 SizeOptions opt("StressMin"); 00095 opt.parse(argc,argv); 00096 opt.size(200); 00097 Script::run<StressMin,DFS,SizeOptions>(opt); 00098 return 0; 00099 } 00100 00101 // STATISTICS: example-any