golomb-ruler.cpp
Go to the documentation of this file.
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2001
*
* This file is part of Gecode, the generic constraint
* development environment:
* http://www.gecode.org
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "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/driver.hh>
#include <gecode/int.hh>
#include <gecode/minimodel.hh>
#include <iomanip>
using namespace Gecode;
class GolombRuler : public IntMinimizeScript {
protected:
IntVarArray m;
public:
GolombRuler(const SizeOptions& opt)
: IntMinimizeScript(opt),
m(*this,opt.size(),0,
(opt.size() < 31) ? (1 << (opt.size()-1))-1 : Int::Limits::max) {
// Assume first mark to be zero
rel(*this, m[0], IRT_EQ, 0);
// Order marks
rel(*this, m, IRT_LE);
// Number of marks and differences
const int n = m.size();
const int n_d = (n*n-n)/2;
// Array of differences
IntVarArgs d(n_d);
// Setup difference constraints
for (int k=0, i=0; i<n-1; i++)
for (int j=i+1; j<n; j++, k++)
// d[k] is m[j]-m[i] and must be at least sum of first j-i integers
rel(*this, d[k] = expr(*this, m[j]-m[i]),
IRT_GQ, (j-i)*(j-i+1)/2);
distinct(*this, d, opt.ipl());
// Symmetry breaking
if (n > 2)
rel(*this, d[0], IRT_LE, d[n_d-1]);
branch(*this, m, INT_VAR_NONE(), INT_VAL_MIN());
}
virtual IntVar cost(void) const {
return m[m.size()-1];
}
virtual void
print(std::ostream& os) const {
os << "\tm[" << m.size() << "] = " << m << std::endl;
}
GolombRuler(GolombRuler& s)
: IntMinimizeScript(s) {
m.update(*this, s.m);
}
virtual Space*
copy(void) {
return new GolombRuler(*this);
}
};
int
main(int argc, char* argv[]) {
SizeOptions opt("GolombRuler");
opt.solutions(0);
opt.size(10);
opt.ipl(IPL_BND);
opt.parse(argc,argv);
if (opt.size() > 0)
IntMinimizeScript::run<GolombRuler,BAB,SizeOptions>(opt);
return 0;
}
// STATISTICS: example-any
Gecode::Driver::ScriptBase< Driver::IgnoreStepOption< IntMinimizeSpace > >::run
static void run(const Options &opt, Script *s=NULL)
Gecode::IntVarArgs
Passing integer variables.
Definition int.hh:656
Gecode::IntVarArray
Integer variable array.
Definition int.hh:763
Gecode::IntVar
Integer variables.
Definition int.hh:371
Gecode::SizeOptions
Options for scripts with additional size parameter
Definition driver.hh:675
Gecode::Space
Computation spaces.
Definition core.hpp:1742
GolombRuler::main
int main(int argc, char *argv[])
Main-function.
Definition golomb-ruler.cpp:129
GolombRuler::copy
virtual Space * copy(void)
Copy during cloning.
Definition golomb-ruler.cpp:120
GolombRuler::print
virtual void print(std::ostream &os) const
Print solution.
Definition golomb-ruler.cpp:109
GolombRuler::m
IntVarArray m
Array for ruler marks.
Definition golomb-ruler.cpp:65
GolombRuler::GolombRuler
GolombRuler(const SizeOptions &opt)
Actual model.
Definition golomb-ruler.cpp:68
GolombRuler::GolombRuler
GolombRuler(GolombRuler &s)
Constructor for cloning s.
Definition golomb-ruler.cpp:114
GolombRuler::cost
virtual IntVar cost(void) const
Return cost.
Definition golomb-ruler.cpp:103
Test::Options::parse
void parse(int argc, char *argv[])
Parse commandline arguments.
Definition test.cpp:120
driver.hh
int.hh
Gecode::IntMinimizeScript
Driver::ScriptBase< Driver::IgnoreStepOption< IntMinimizeSpace > > IntMinimizeScript
Base-class for scripts for finding solution of lowest integer cost.
Definition driver.hh:808
Gecode::branch
void branch(Home home, const FloatVarArgs &x, FloatVarBranch vars, FloatValBranch vals, FloatBranchFilter bf=nullptr, FloatVarValPrint vvp=nullptr)
Branch over x with variable selection vars and value selection vals.
Definition branch.cpp:39
Gecode::rel
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVar x1)
Post propagator for .
Definition rel.cpp:68
Gecode::IRT_EQ
@ IRT_EQ
Equality ( ).
Definition int.hh:926
Gecode::IRT_GQ
@ IRT_GQ
Greater or equal ( ).
Definition int.hh:930
Gecode::IRT_LE
@ IRT_LE
Less ( ).
Definition int.hh:929
Gecode::IPL_BND
@ IPL_BND
Bounds propagation.
Definition int.hh:978
minimodel.hh
Gecode::Int::Limits
Numerical limits for integer variables.
Definition int.hh:114
Gecode::Int
Finite domain integers.
Gecode
Gecode toplevel namespace
Gecode::expr
IntVar expr(Home home, const LinIntExpr &e, const IntPropLevels &ipls=IntPropLevels::def)
Post linear expression and return its value.
Definition int-expr.cpp:915
Gecode::distinct
void distinct(Home home, const IntVarArgs &x, IntPropLevel ipl=IPL_DEF)
Post propagator for for all .
Definition distinct.cpp:46
Gecode::INT_VAR_NONE
IntVarBranch INT_VAR_NONE(void)
Select first unassigned variable.
Definition var.hpp:96
Gecode::INT_VAL_MIN
IntValBranch INT_VAL_MIN(void)
Select smallest value.
Definition val.hpp:55
Gecode::max
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition arithmetic.cpp:49