"A globally-optimal solution can always be found by a series of local improvements from a starting configuration" is a property used by1 pointGreedy AlgorithmDynamic ProgrammingBrute ForceBranch and Bound

The property "A globally-optimal solution can always be found by a series of local improvements from a starting configuration" is used by the Greedy Algorithm.

Here's why:

1. The Greedy Algorithm makes the locally optimal choice at each stage with the hope that these local choices will lead to a global optimum. It never reconsiders its choices, which is the main difference from dynamic programming, which is exhaustive and can reconsider choices.

2. This method doesn't apply to Dynamic Programming because Dynamic Programming is all about breaking down a problem into smaller subproblems and then combining the solutions of the subproblems to reach an overall solution. It doesn't necessarily follow the property of local improvements leading to a global optimum.

3. Brute Force doesn't follow this property either. Brute Force tries all possible solutions until it finds the best one. It doesn't make a series of local improvements; instead, it exhaustively tries everything.

4. Lastly, Branch and Bound is a method for solving combinatorial optimization problems. It involves partitioning the problem into subproblems and solving them independently. This method also doesn't follow the property of local improvements leading to a global optimum.

So, the answer is Greedy Algorithm.