Generated on Thu Apr 5 2018 19:44:19 for Gecode by doxygen 1.8.13
optimize.cpp
Go to the documentation of this file.
1 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2 /*
3  * Main author:
4  * Christian Schulte <schulte@gecode.org>
5  *
6  * Copyright:
7  * Christian Schulte, 2008
8  *
9  * Last modified:
10  * $Date$ by $Author$
11  * $Revision$
12  *
13  * This file is part of Gecode, the generic constraint
14  * development environment:
15  * http://www.gecode.org
16  *
17  * Permission is hereby granted, free of charge, to any person obtaining
18  * a copy of this software and associated documentation files (the
19  * "Software"), to deal in the Software without restriction, including
20  * without limitation the rights to use, copy, modify, merge, publish,
21  * distribute, sublicense, and/or sell copies of the Software, and to
22  * permit persons to whom the Software is furnished to do so, subject to
23  * the following conditions:
24  *
25  * The above copyright notice and this permission notice shall be
26  * included in all copies or substantial portions of the Software.
27  *
28  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
29  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
30  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
31  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
32  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
33  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
34  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
35  *
36  */
37 
38 #include <gecode/minimodel.hh>
39 
40 namespace Gecode {
41 
42  void
44  const IntMinimizeSpace* best =
45  dynamic_cast<const IntMinimizeSpace*>(&_best);
46  if (best == NULL)
47  throw DynamicCastFailed("IntMinimizeSpace::constrain");
48  rel(*this, cost(), IRT_LE, best->cost().val());
49  }
50 
51 
52  void
54  const IntMaximizeSpace* best =
55  dynamic_cast<const IntMaximizeSpace*>(&_best);
56  if (best == NULL)
57  throw DynamicCastFailed("IntMaximizeSpace::constrain");
58  rel(*this, cost(), IRT_GR, best->cost().val());
59  }
60 
61 
62  void
64  const IntLexMinimizeSpace* best =
65  dynamic_cast<const IntLexMinimizeSpace*>(&_best);
66  if (best == NULL)
67  throw DynamicCastFailed("IntLexMinimizeSpace::constrain");
68  IntVarArgs cx(cost()), bx(best->cost());
69  IntArgs bn(bx.size());
70  for (int i=bn.size(); i--; )
71  bn[i] = bx[i].val();
72  rel(*this, cx, IRT_LE, bn);
73  }
74 
75  void
77  const IntLexMaximizeSpace* best =
78  dynamic_cast<const IntLexMaximizeSpace*>(&_best);
79  if (best == NULL)
80  throw DynamicCastFailed("IntLexMaximizeSpace::constrain");
81  IntVarArgs cx(cost()), bx(best->cost());
82  IntArgs bn(bx.size());
83  for (int i=bn.size(); i--; )
84  bn[i] = bx[i].val();
85  rel(*this, cx, IRT_GR, bn);
86  }
87 
88 #ifdef GECODE_HAS_FLOAT_VARS
89 
90  void
92  const FloatMinimizeSpace* best =
93  dynamic_cast<const FloatMinimizeSpace*>(&_best);
94  if (best == NULL)
95  throw DynamicCastFailed("FloatMinimizeSpace::constrain");
96  rel(*this, cost(), FRT_LE, best->cost().val()-step);
97  }
98 
99 
100  void
102  const FloatMaximizeSpace* best =
103  dynamic_cast<const FloatMaximizeSpace*>(&_best);
104  if (best == NULL)
105  throw DynamicCastFailed("FloatMaximizeSpace::constrain");
106  rel(*this, cost(), FRT_GR, best->cost().val()+step);
107  }
108 
109 #endif
110 
111 }
112 
113 // STATISTICS: minimodel-search
114 
const Gecode::FloatNum step
Definition: arithmetic.cpp:789
Class for minimizing integer cost.
Definition: minimodel.hh:2336
Class for lexicographically maximizing integer costs.
Definition: minimodel.hh:2387
int size(void) const
Return size of array (number of elements)
Definition: array.hpp:1657
virtual IntVar cost(void) const =0
Return variable with current cost.
Less ( )
Definition: float.hh:1073
Greater ( )
Definition: int.hh:910
FloatVal val(void) const
Return assigned value.
Definition: float.hpp:57
Class for maximizing float cost.
Definition: minimodel.hh:2436
Computation spaces.
Definition: core.hpp:1668
virtual void constrain(const Space &best)
Member function constraining according to decreasing cost.
Definition: optimize.cpp:43
virtual void constrain(const Space &best)
Member function constraining according to cost.
Definition: optimize.cpp:91
Gecode::IntArgs i(4, 1, 2, 3, 4)
virtual IntVarArgs cost(void) const =0
Return variables with current costs.
virtual void constrain(const Space &best)
Member function constraining according to increasing cost.
Definition: optimize.cpp:53
int val(void) const
Return assigned value.
Definition: int.hpp:60
virtual FloatVar cost(void) const =0
Return variable with current cost.
Exception: dynamic cast failed
Definition: exception.hpp:73
Class for lexicographically minimizing integer costs.
Definition: minimodel.hh:2370
virtual void constrain(const Space &best)
Member function constraining according to increasing costs.
Definition: optimize.cpp:76
Less ( )
Definition: int.hh:908
virtual void constrain(const Space &best)
Member function constraining according to cost.
Definition: optimize.cpp:101
Passing integer variables.
Definition: int.hh:637
Passing integer arguments.
Definition: int.hh:608
Greater ( )
Definition: float.hh:1075
Class for maximizing integer cost.
Definition: minimodel.hh:2353
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVal n)
Propagates .
Definition: rel.cpp:47
virtual IntVar cost(void) const =0
Return variable with current cost.
virtual void constrain(const Space &best)
Member function constraining according to decreasing costs.
Definition: optimize.cpp:63
Class for minimizing float cost.
Definition: minimodel.hh:2411
virtual IntVarArgs cost(void) const =0
Return variables with current costs.
Gecode toplevel namespace
virtual FloatVar cost(void) const =0
Return variable with current cost.