allow for explicit branching candidates

hlefebvr · Oct 20, 2023 · 1f8f6f3 · 1f8f6f3
1 parent 38083f4
commit 1f8f6f3
Show file tree

Hide file tree

Showing 6 changed files with 18 additions and 0 deletions.
diff --git a/...include/idol/optimizers/branch-and-bound/branching-rules/factories/FirstInfeasibleFound.h b/...include/idol/optimizers/branch-and-bound/branching-rules/factories/FirstInfeasibleFound.h
@@ -16,6 +16,9 @@ class idol::FirstInfeasibleFound : public idol::VariableBranching {
 public:
     FirstInfeasibleFound() = default;
 
+    template<class IteratorT>
+    FirstInfeasibleFound(IteratorT t_begin, IteratorT t_end) : idol::VariableBranching(t_begin, t_end) {}
+
     template<class NodeVarInfoT>
     class Strategy : public VariableBranching::Strategy<NodeVarInfoT> {
     public:

diff --git a/lib/include/idol/optimizers/branch-and-bound/branching-rules/factories/LeastInfeasible.h b/lib/include/idol/optimizers/branch-and-bound/branching-rules/factories/LeastInfeasible.h
@@ -16,6 +16,9 @@ class idol::LeastInfeasible : public idol::VariableBranching {
 public:
     LeastInfeasible() = default;
 
+    template<class IteratorT>
+    LeastInfeasible(IteratorT t_begin, IteratorT t_end) : idol::VariableBranching(t_begin, t_end) {}
+
     template<class NodeVarInfoT>
     class Strategy : public VariableBranching::Strategy<NodeVarInfoT> {
     public:

diff --git a/lib/include/idol/optimizers/branch-and-bound/branching-rules/factories/MostInfeasible.h b/lib/include/idol/optimizers/branch-and-bound/branching-rules/factories/MostInfeasible.h
@@ -16,6 +16,9 @@ class idol::MostInfeasible : public idol::VariableBranching {
 public:
     MostInfeasible() = default;
 
+    template<class IteratorT>
+    MostInfeasible(IteratorT t_begin, IteratorT t_end) : idol::VariableBranching(t_begin, t_end) {}
+
     template<class NodeVarInfoT>
     class Strategy : public VariableBranching::Strategy<NodeVarInfoT> {
     public:

diff --git a/lib/include/idol/optimizers/branch-and-bound/branching-rules/factories/PseudoCost.h b/lib/include/idol/optimizers/branch-and-bound/branching-rules/factories/PseudoCost.h
@@ -16,6 +16,9 @@ class idol::PseudoCost : public idol::VariableBranching {
 public:
     PseudoCost() = default;
 
+    template<class IteratorT>
+    PseudoCost(IteratorT t_begin, IteratorT t_end) : idol::VariableBranching(t_begin, t_end) {}
+
     template<class NodeVarInfoT>
     class Strategy : public VariableBranching::Strategy<NodeVarInfoT> {
     public:

diff --git a/lib/include/idol/optimizers/branch-and-bound/branching-rules/factories/StrongBranching.h b/lib/include/idol/optimizers/branch-and-bound/branching-rules/factories/StrongBranching.h
@@ -18,6 +18,9 @@ class idol::StrongBranching : public idol::VariableBranching {
 public:
     StrongBranching() = default;
 
+    template<class IteratorT>
+    StrongBranching(IteratorT t_begin, IteratorT t_end) : idol::VariableBranching(t_begin, t_end) {}
+
     template<class NodeVarInfoT>
     class Strategy : public VariableBranching::Strategy<NodeVarInfoT> {
         std::optional<unsigned int> m_max_n_variables;

diff --git a/lib/include/idol/optimizers/branch-and-bound/branching-rules/factories/UniformlyRandom.h b/lib/include/idol/optimizers/branch-and-bound/branching-rules/factories/UniformlyRandom.h
@@ -17,6 +17,9 @@ class idol::UniformlyRandom : public idol::VariableBranching {
 public:
     UniformlyRandom() = default;
 
+    template<class IteratorT>
+    UniformlyRandom(IteratorT t_begin, IteratorT t_end) : idol::VariableBranching(t_begin, t_end) {}
+
     template<class NodeVarInfoT>
     class Strategy : public VariableBranching::Strategy<NodeVarInfoT> {
         std::optional<unsigned int> m_seed;