diff --git a/examples/tests/ls_test.cc b/examples/tests/ls_test.cc
new file mode 100644
index 0000000000..b8b7f8905c
--- /dev/null
+++ b/examples/tests/ls_test.cc
@@ -0,0 +1,77 @@
+// Copyright 2011-2012 Google
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+
+#include "base/hash.h"
+#include "base/map-util.h"
+#include "base/stl_util.h"
+#include "base/random.h"
+#include "constraint_solver/constraint_solveri.h"
+#include "constraint_solver/constraint_solver.h"
+#include "constraint_solver/model.pb.h"
+
+namespace operations_research {
+class OneVarLns : public BaseLNS {
+ public:
+  OneVarLns(const IntVar* const* vars, int size)
+      : BaseLNS(vars, size),
+        index_(0) {}
+
+  ~OneVarLns() {}
+
+  virtual void InitFragments() { index_ = 0; }
+
+  virtual bool NextFragment(std::vector<int>* fragment) {
+    const int size = Size();
+    if (index_ < size) {
+      fragment->push_back(index_);
+      ++index_;
+      return true;
+    } else {
+      return false;
+    }
+  }
+
+ private:
+  int index_;
+};
+
+void Basic_LS() {
+  Solver s("Sample");
+  vector<IntVar*> vars;
+  s.MakeIntVarArray(10, 0, 10, &vars);
+  IntVar* const sum_var = s.MakeSum(vars)->Var();
+  OptimizeVar* const obj = s.MakeMinimize(sum_var, 1);
+  DecisionBuilder* const db =
+      s.MakePhase(vars,
+                  Solver::CHOOSE_FIRST_UNBOUND,
+                  Solver::ASSIGN_MAX_VALUE);
+  OneVarLns one_var_lns(vars.data(), vars.size());
+  LocalSearchPhaseParameters* const ls_params =
+      s.MakeLocalSearchPhaseParameters(&one_var_lns, db);
+  DecisionBuilder* const ls = s.MakeLocalSearchPhase(vars, db, ls_params);
+  SolutionCollector* const collector = s.MakeLastSolutionCollector();
+  collector->Add(vars);
+  //  collector->AddObjective(sum_var);
+  SearchMonitor* const log = s.MakeSearchLog(100, obj);
+  s.Solve(ls, collector, obj, log);
+  LOG(INFO) << "Objective value = " << collector->objective_value(0);
+}
+}  //namespace operations_research
+
+int main(int argc, char** argv) {
+  google::ParseCommandLineFlags(&argc, &argv, true);
+  operations_research::Basic_LS();
+  return 0;
+}
+
diff --git a/makefiles/Makefile.cpp.mk b/makefiles/Makefile.cpp.mk
index 18c3fd6d89..5d68272a21 100644
--- a/makefiles/Makefile.cpp.mk
+++ b/makefiles/Makefile.cpp.mk
@@ -770,6 +770,12 @@ $(OBJ_DIR)/boolean_test.$O:$(EX_DIR)/tests/boolean_test.cc $(SRC_DIR)/constraint
 $(BIN_DIR)/boolean_test$E: $(CP_DEPS) $(OBJ_DIR)/boolean_test.$O
 	$(CCC) $(CFLAGS) $(OBJ_DIR)/boolean_test.$O $(CP_LNK) $(LDFLAGS) $(EXEOUT)boolean_test$E
 
+$(OBJ_DIR)/ls_test.$O:$(EX_DIR)/tests/ls_test.cc $(SRC_DIR)/constraint_solver/constraint_solver.h
+	$(CCC) $(CFLAGS) -c $(EX_DIR)$Stests/ls_test.cc $(OBJ_OUT)ls_test.$O
+
+$(BIN_DIR)/ls_test$E: $(CP_DEPS) $(OBJ_DIR)/ls_test.$O
+	$(CCC) $(CFLAGS) $(OBJ_DIR)/ls_test.$O $(CP_LNK) $(LDFLAGS) $(EXEOUT)ls_test$E
+
 # Linear Programming Examples
 
 $(OBJ_DIR)/strawberry_fields_with_column_generation.$O: $(EX_DIR)/cpp/strawberry_fields_with_column_generation.cc $(SRC_DIR)/linear_solver/linear_solver.h