minimodel.hh File Reference
(Revision: 10684)
#include <gecode/kernel.hh>
#include <gecode/int.hh>
#include <gecode/set.hh>
#include <gecode/int/linear.hh>
#include <gecode/minimodel/exception.hpp>
#include <iostream>
#include <gecode/support/auto-link.hpp>
#include <gecode/minimodel/lin-expr.hpp>
#include <gecode/minimodel/lin-rel.hpp>
#include <gecode/minimodel/bool-expr.hpp>
#include <gecode/minimodel/bool-rel.hpp>
#include <gecode/minimodel/arithmetic.hpp>
#include <gecode/minimodel/matrix.hpp>
#include <gecode/minimodel/optimize.hpp>
Go to the source code of this file.
Classes | |
class | Gecode::LinExpr |
Linear expressions. More... | |
class | Gecode::LinRel |
Linear relations. More... | |
class | Gecode::BoolExpr |
Boolean expressions. More... | |
class | Gecode::BoolExpr::Node |
Node for Boolean expression More... | |
class | Gecode::BoolExpr::NNF |
Node for negation normalform (NNF) More... | |
class | Gecode::BoolRel |
Boolean relations. More... | |
class | Gecode::REG |
Regular expressions over integer values. More... | |
class | Gecode::Matrix< A > |
Matrix-interface for arrays. More... | |
class | Gecode::Matrix< A >::Slice |
A slice of a matrix. More... | |
class | Gecode::MiniModel::OptimizeSpace< irt > |
Baseclass for cost-based optimization. More... | |
Namespaces | |
namespace | Gecode |
Gecode toplevel namespace | |
namespace | Gecode::MiniModel |
Minimalistic modeling support. | |
Defines | |
#define | GECODE_MINIMODEL_EXPORT |
#define | GECODE_LIBRARY_NAME "MiniModel" |
Typedefs | |
typedef MiniModel::OptimizeSpace < IRT_LE > | Gecode::MinimizeSpace |
Class for minimizing cost. | |
typedef MiniModel::OptimizeSpace < IRT_GR > | Gecode::MaximizeSpace |
Class for maximizing cost. | |
Functions | |
LinExpr | Gecode::operator+ (int, const IntVar &) |
Construct linear expression as sum of integer variable and integer. | |
LinExpr | Gecode::operator+ (int, const BoolVar &) |
Construct linear expression as sum of Boolean variable and integer. | |
LinExpr | Gecode::operator+ (int, const LinExpr &) |
Construct linear expression as sum of linear expression and integer. | |
LinExpr | Gecode::operator+ (const IntVar &, int) |
Construct linear expression as sum of integer variable and integer. | |
LinExpr | Gecode::operator+ (const BoolVar &, int) |
Construct linear expression as sum of Boolean variable and integer. | |
LinExpr | Gecode::operator+ (const LinExpr &, int) |
Construct linear expression as sum of linear expression and integer. | |
LinExpr | Gecode::operator+ (const IntVar &, const IntVar &) |
Construct linear expression as sum of integer variables. | |
LinExpr | Gecode::operator+ (const IntVar &, const BoolVar &) |
Construct linear expression as sum of integer and Boolean variable. | |
LinExpr | Gecode::operator+ (const BoolVar &, const IntVar &) |
Construct linear expression as sum of Boolean and integer variable. | |
LinExpr | Gecode::operator+ (const BoolVar &, const BoolVar &) |
Construct linear expression as sum of Boolean variables. | |
LinExpr | Gecode::operator+ (const IntVar &, const LinExpr &) |
Construct linear expression as sum of integer variable and linear expression. | |
LinExpr | Gecode::operator+ (const BoolVar &, const LinExpr &) |
Construct linear expression as sum of Boolean variable and linear expression. | |
LinExpr | Gecode::operator+ (const LinExpr &, const IntVar &) |
Construct linear expression as sum of linear expression and integer variable. | |
LinExpr | Gecode::operator+ (const LinExpr &, const BoolVar &) |
Construct linear expression as sum of linear expression and Boolean variable. | |
LinExpr | Gecode::operator+ (const LinExpr &, const LinExpr &) |
Construct linear expression as sum of linear expressions. | |
LinExpr | Gecode::operator- (int, const IntVar &) |
Construct linear expression as sum of integer variable and integer. | |
LinExpr | Gecode::operator- (int, const BoolVar &) |
Construct linear expression as sum of Boolean variable and integer. | |
LinExpr | Gecode::operator- (int, const LinExpr &) |
Construct linear expression as sum of integer and linear expression. | |
LinExpr | Gecode::operator- (const IntVar &, int) |
Construct linear expression as sum of integer variable and integer. | |
LinExpr | Gecode::operator- (const BoolVar &, int) |
Construct linear expression as sum of Boolean variable and integer. | |
LinExpr | Gecode::operator- (const LinExpr &, int) |
Construct linear expression as sum of linear expression and integer. | |
LinExpr | Gecode::operator- (const IntVar &, const IntVar &) |
Construct linear expression as sum of integer variables. | |
LinExpr | Gecode::operator- (const IntVar &, const BoolVar &) |
Construct linear expression as sum of integer and Boolean variable. | |
LinExpr | Gecode::operator- (const BoolVar &, const IntVar &) |
Construct linear expression as sum of Boolean and integer variable. | |
LinExpr | Gecode::operator- (const BoolVar &, const BoolVar &) |
Construct linear expression as sum of Boolean variables. | |
LinExpr | Gecode::operator- (const IntVar &, const LinExpr &) |
Construct linear expression as sum of integer variable and linear expression. | |
LinExpr | Gecode::operator- (const BoolVar &, const LinExpr &) |
Construct linear expression as sum of Boolean variable and linear expression. | |
LinExpr | Gecode::operator- (const LinExpr &, const IntVar &) |
Construct linear expression as sum of linear expression and integer variable. | |
LinExpr | Gecode::operator- (const LinExpr &, const BoolVar &) |
Construct linear expression as sum of linear expression and Boolean variable. | |
LinExpr | Gecode::operator- (const LinExpr &, const LinExpr &) |
Construct linear expression as sum of linear expressions. | |
LinExpr | Gecode::operator- (const IntVar &) |
Construct linear expression as negative of integer variable. | |
LinExpr | Gecode::operator- (const BoolVar &) |
Construct linear expression as negative of Boolean variable. | |
LinExpr | Gecode::operator- (const LinExpr &) |
Construct linear expression as negative of linear expression. | |
LinExpr | Gecode::operator* (int, const IntVar &) |
Construct linear expression as product of integer coefficient and integer variable. | |
LinExpr | Gecode::operator* (int, const BoolVar &) |
Construct linear expression as product of integer coefficient and Boolean variable. | |
LinExpr | Gecode::operator* (const IntVar &, int) |
Construct linear expression as product of integer coefficient and integer variable. | |
LinExpr | Gecode::operator* (const BoolVar &, int) |
Construct linear expression as product of integer coefficient and Boolean variable. | |
LinExpr | Gecode::operator* (const LinExpr &, int) |
Construct linear expression as product of integer coefficient and linear expression. | |
LinExpr | Gecode::operator* (int, const LinExpr &) |
Construct linear expression as product of integer coefficient and linear expression. | |
LinExpr | Gecode::sum (const IntVarArgs &x) |
Construct linear expression as sum of integer variables. | |
LinExpr | Gecode::sum (const IntArgs &a, const IntVarArgs &x) |
Construct linear expression as sum of integer variables with coefficients. | |
LinExpr | Gecode::sum (const BoolVarArgs &x) |
Construct linear expression as sum of Boolean variables. | |
LinExpr | Gecode::sum (const IntArgs &a, const BoolVarArgs &x) |
Construct linear expression as sum of Boolean variables with coefficients. | |
LinRel | Gecode::operator== (int l, const IntVar &r) |
Construct linear equality relation. | |
LinRel | Gecode::operator== (int l, const BoolVar &r) |
Construct linear equality relation. | |
LinRel | Gecode::operator== (int l, const LinExpr &r) |
Construct linear equality relation. | |
LinRel | Gecode::operator== (const IntVar &l, int r) |
Construct linear equality relation. | |
LinRel | Gecode::operator== (const BoolVar &l, int r) |
Construct linear equality relation. | |
LinRel | Gecode::operator== (const LinExpr &l, int r) |
Construct linear equality relation. | |
LinRel | Gecode::operator== (const IntVar &l, const IntVar &r) |
Construct linear equality relation. | |
LinRel | Gecode::operator== (const IntVar &l, const BoolVar &r) |
Construct linear equality relation. | |
LinRel | Gecode::operator== (const BoolVar &l, const IntVar &r) |
Construct linear equality relation. | |
LinRel | Gecode::operator== (const BoolVar &l, const BoolVar &r) |
Construct linear equality relation. | |
LinRel | Gecode::operator== (const IntVar &l, const LinExpr &r) |
Construct linear equality relation. | |
LinRel | Gecode::operator== (const BoolVar &l, const LinExpr &r) |
Construct linear equality relation. | |
LinRel | Gecode::operator== (const LinExpr &l, const IntVar &r) |
Construct linear equality relation. | |
LinRel | Gecode::operator== (const LinExpr &l, const BoolVar &r) |
Construct linear equality relation. | |
LinRel | Gecode::operator== (const LinExpr &l, const LinExpr &r) |
Construct linear equality relation. | |
LinRel | Gecode::operator!= (int l, const IntVar &r) |
Construct linear disequality relation. | |
LinRel | Gecode::operator!= (int l, const BoolVar &r) |
Construct linear disequality relation. | |
LinRel | Gecode::operator!= (int l, const LinExpr &r) |
Construct linear disequality relation. | |
LinRel | Gecode::operator!= (const IntVar &l, int r) |
Construct linear disequality relation. | |
LinRel | Gecode::operator!= (const BoolVar &l, int r) |
Construct linear disequality relation. | |
LinRel | Gecode::operator!= (const LinExpr &l, int r) |
Construct linear disequality relation. | |
LinRel | Gecode::operator!= (const IntVar &l, const IntVar &r) |
Construct linear disequality relation. | |
LinRel | Gecode::operator!= (const IntVar &l, const BoolVar &r) |
Construct linear disequality relation. | |
LinRel | Gecode::operator!= (const BoolVar &l, const IntVar &r) |
Construct linear disequality relation. | |
LinRel | Gecode::operator!= (const BoolVar &l, const BoolVar &r) |
Construct linear disequality relation. | |
LinRel | Gecode::operator!= (const IntVar &l, const LinExpr &r) |
Construct linear disequality relation. | |
LinRel | Gecode::operator!= (const BoolVar &l, const LinExpr &r) |
Construct linear disequality relation. | |
LinRel | Gecode::operator!= (const LinExpr &l, const IntVar &r) |
Construct linear disequality relation. | |
LinRel | Gecode::operator!= (const LinExpr &l, const BoolVar &r) |
Construct linear disequality relation. | |
LinRel | Gecode::operator!= (const LinExpr &l, const LinExpr &r) |
Construct linear disequality relation. | |
LinRel | Gecode::operator< (int l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator< (int l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator< (int l, const LinExpr &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator< (const IntVar &l, int r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator< (const BoolVar &l, int r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator< (const LinExpr &l, int r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator< (const IntVar &l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator< (const IntVar &l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator< (const BoolVar &l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator< (const BoolVar &l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator< (const IntVar &l, const LinExpr &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator< (const BoolVar &l, const LinExpr &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator< (const LinExpr &l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator< (const LinExpr &l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator< (const LinExpr &l, const LinExpr &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator<= (int l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator<= (int l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator<= (int l, const LinExpr &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator<= (const IntVar &l, int r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator<= (const BoolVar &l, int r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator<= (const LinExpr &l, int r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator<= (const IntVar &l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator<= (const IntVar &l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator<= (const BoolVar &l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator<= (const BoolVar &l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator<= (const IntVar &l, const LinExpr &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator<= (const BoolVar &l, const LinExpr &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator<= (const LinExpr &l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator<= (const LinExpr &l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator<= (const LinExpr &l, const LinExpr &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator> (int l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator> (int l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator> (int l, const LinExpr &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator> (const IntVar &l, int r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator> (const BoolVar &l, int r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator> (const LinExpr &l, int r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator> (const IntVar &l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator> (const IntVar &l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator> (const BoolVar &l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator> (const BoolVar &l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator> (const IntVar &l, const LinExpr &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator> (const BoolVar &l, const LinExpr &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator> (const LinExpr &l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator> (const LinExpr &l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator> (const LinExpr &l, const LinExpr &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator>= (int l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator>= (int l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator>= (int l, const LinExpr &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator>= (const IntVar &l, int r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator>= (const BoolVar &l, int r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator>= (const LinExpr &l, int r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator>= (const IntVar &l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator>= (const IntVar &l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator>= (const BoolVar &l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator>= (const BoolVar &l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator>= (const IntVar &l, const LinExpr &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator>= (const BoolVar &l, const LinExpr &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator>= (const LinExpr &l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator>= (const LinExpr &l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel | Gecode::operator>= (const LinExpr &l, const LinExpr &r) |
Construct linear inequality relation. | |
BoolExpr | Gecode::operator! (const BoolExpr &) |
Negated Boolean expression. | |
BoolExpr | Gecode::operator&& (const BoolExpr &, const BoolExpr &) |
Conjunction of Boolean expressions. | |
BoolExpr | Gecode::operator|| (const BoolExpr &, const BoolExpr &) |
Disjunction of Boolean expressions. | |
BoolExpr | Gecode::operator^ (const BoolExpr &, const BoolExpr &) |
Exclusive-or of Boolean expressions. | |
BoolExpr | Gecode::operator~ (const LinRel &) |
Reification of linear relations. | |
BoolExpr | Gecode::eqv (const BoolExpr &, const BoolExpr &) |
Equivalence of Boolean expressions. | |
BoolExpr | Gecode::imp (const BoolExpr &, const BoolExpr &) |
Implication of Boolean expressions. | |
BoolRel | Gecode::tt (const BoolExpr &) |
State that Boolean expression must be true. | |
BoolRel | Gecode::ff (const BoolExpr &) |
State that Boolean expression must be false. | |
IntVar | Gecode::post (Home home, const LinExpr &e, IntConLevel icl=ICL_DEF) |
Post linear expression and return its value. | |
void | Gecode::post (Home home, const LinRel &r, IntConLevel icl=ICL_DEF) |
Post linear relation. | |
BoolVar | Gecode::post (Home home, const BoolExpr &e, IntConLevel icl=ICL_DEF) |
Post Boolean expression and return its value. | |
void | Gecode::post (Home home, const BoolRel &r, IntConLevel icl=ICL_DEF) |
Post Boolean relation. | |
IntVar | Gecode::abs (Home home, IntVar x, IntConLevel icl=ICL_DEF) |
Return variable constrained to ![]() | |
IntVar | Gecode::min (Home home, IntVar x, IntVar y, IntConLevel icl=ICL_DEF) |
Return variable constrained to ![]() | |
IntVar | Gecode::min (Home home, const IntVarArgs &x, IntConLevel icl=ICL_DEF) |
Return variable constrained to ![]() | |
IntVar | Gecode::max (Home home, IntVar x, IntVar y, IntConLevel icl=ICL_DEF) |
Return variable constrained to ![]() | |
IntVar | Gecode::max (Home home, const IntVarArgs &x, IntConLevel icl=ICL_DEF) |
Return variable constrained to ![]() | |
IntVar | Gecode::mult (Home home, IntVar x, IntVar y, IntConLevel icl=ICL_DEF) |
Return variable constrained to ![]() | |
IntVar | Gecode::div (Home home, IntVar x, IntVar y, IntConLevel icl=ICL_DEF) |
Return variable constrained to ![]() | |
IntVar | Gecode::mod (Home home, IntVar x, IntVar y, IntConLevel icl=ICL_DEF) |
Return variable constrained to ![]() | |
IntVar | Gecode::sqr (Home home, IntVar x, IntConLevel icl=ICL_DEF) |
Return variable constrained to ![]() | |
IntVar | Gecode::sqrt (Home home, IntVar x, IntConLevel icl=ICL_DEF) |
Return variable constrained to ![]() | |
IntVar | Gecode::plus (Home home, IntVar x, IntVar y, IntConLevel icl=ICL_DEF) |
Return variable constrained to ![]() | |
IntVar | Gecode::minus (Home home, IntVar x, IntVar y, IntConLevel icl) |
BoolVar | Gecode::channel (Home home, IntVar x, IntConLevel icl=ICL_DEF) |
Return Boolean variable equal to ![]() | |
IntVar | Gecode::channel (Home home, BoolVar b, IntConLevel icl=ICL_DEF) |
Return integer variable equal to ![]() | |
void | Gecode::atmost (Home home, const IntVarArgs &x, int n, int m, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | Gecode::atmost (Home home, const IntVarArgs &x, IntVar y, int m, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | Gecode::atmost (Home home, const IntVarArgs &x, const IntArgs &y, int m, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | Gecode::atmost (Home home, const IntVarArgs &x, int n, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | Gecode::atmost (Home home, const IntVarArgs &x, IntVar y, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | Gecode::atmost (Home home, const IntVarArgs &x, const IntArgs &y, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | Gecode::atleast (Home home, const IntVarArgs &x, int n, int m, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | Gecode::atleast (Home home, const IntVarArgs &x, IntVar y, int m, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | Gecode::atleast (Home home, const IntVarArgs &x, const IntArgs &y, int m, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | Gecode::atleast (Home home, const IntVarArgs &x, int n, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | Gecode::atleast (Home home, const IntVarArgs &x, IntVar y, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | Gecode::atleast (Home home, const IntVarArgs &x, const IntArgs &y, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | Gecode::exactly (Home home, const IntVarArgs &x, int n, int m, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | Gecode::exactly (Home home, const IntVarArgs &x, IntVar y, int m, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | Gecode::exactly (Home home, const IntVarArgs &x, const IntArgs &y, int m, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | Gecode::exactly (Home home, const IntVarArgs &x, int n, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | Gecode::exactly (Home home, const IntVarArgs &x, IntVar y, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | Gecode::exactly (Home home, const IntVarArgs &x, const IntArgs &y, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | Gecode::lex (Home home, const IntVarArgs &x, IntRelType r, const IntVarArgs &y, IntConLevel icl=ICL_DEF) |
Post propagator for lexical order between x and y. | |
void | Gecode::lex (Home home, const BoolVarArgs &x, IntRelType r, const BoolVarArgs &y, IntConLevel icl=ICL_DEF) |
Post propagator for lexical order between x and y. |
Define Documentation
#define GECODE_MINIMODEL_EXPORT |
Definition at line 78 of file minimodel.hh.
#define GECODE_LIBRARY_NAME "MiniModel" |
Definition at line 85 of file minimodel.hh.