Jip J. Dekker
1d9faf38de
git-subtree-dir: software/gecode git-subtree-split: 313e87646da4fc2752a70e83df16d993121a8e40
90 lines
2.8 KiB
C++
90 lines
2.8 KiB
C++
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
|
|
/*
|
|
* Main authors:
|
|
* Christian Schulte <schulte@gecode.org>
|
|
*
|
|
* Contributing authors:
|
|
* Guido Tack <tack@gecode.org>
|
|
*
|
|
* Copyright:
|
|
* Christian Schulte, 2004
|
|
* Guido Tack, 2004
|
|
*
|
|
* 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.
|
|
*
|
|
*/
|
|
|
|
#ifndef GECODE_SEARCH_SEQ_BAB_HH
|
|
#define GECODE_SEARCH_SEQ_BAB_HH
|
|
|
|
#include <gecode/search.hh>
|
|
#include <gecode/search/support.hh>
|
|
#include <gecode/search/worker.hh>
|
|
#include <gecode/search/seq/path.hh>
|
|
|
|
namespace Gecode { namespace Search { namespace Seq {
|
|
|
|
/// Implementation of depth-first branch-and-bound search engine
|
|
template<class Tracer>
|
|
class BAB : public Worker {
|
|
private:
|
|
/// Search tracer
|
|
Tracer tracer;
|
|
/// Search options
|
|
Options opt;
|
|
/// Current path in search tree
|
|
Path<Tracer> path;
|
|
/// Current space being explored
|
|
Space* cur;
|
|
/// Distance until next clone
|
|
unsigned int d;
|
|
/// Number of entries not yet constrained to be better
|
|
int mark;
|
|
/// Best solution found so far
|
|
Space* best;
|
|
public:
|
|
/// Initialize with space \a s and search options \a o
|
|
BAB(Space* s, const Options& o);
|
|
/// %Search for next better solution
|
|
Space* next(void);
|
|
/// Return statistics
|
|
Statistics statistics(void) const;
|
|
/// Constrain future solutions to be better than \a b
|
|
void constrain(const Space& b);
|
|
/// Reset engine to restart at space \a s
|
|
void reset(Space* s);
|
|
/// Return no-goods
|
|
NoGoods& nogoods(void);
|
|
/// Destructor
|
|
~BAB(void);
|
|
};
|
|
|
|
}}}
|
|
|
|
#include <gecode/search/seq/bab.hpp>
|
|
|
|
#endif
|
|
|
|
// STATISTICS: search-seq
|