Add to ORKG178 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2002.The properties of polynomially computable neighborhood functions are also examined. The global verification of several problems is proven to be NP-complete. These results are extended to show that polynomially computable neighborhood functions have arbitrarily poor local optima.U of I OnlyRestricted to the U of I community idenfinitely during batch ingest of legacy ETD
Local search has been applied successfully to a diverse collection of optimization problems. It's ap...
Local search has been applied successfully to a diverse collection of optimization problems. It's ap...
Local search has been applied successfully to a diverse collection of optimization problems. It's ap...
178 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2002.The properties of polynomiall...
A drawback to using local search algorithms to address NP-hard discrete optimization problems is tha...
International audienceThis chapter sets up a formal framework for local search and provides a certai...
Many discrete optimization problems of practical interest cannot be solved to optimality in the avai...
Local search algorithms for combinatorial optimization problems are in general of pseudopolynomial r...
We investigate the complexity of finding locally optimal solutions to NP-hard com-binatorial optimiz...
Local search is a widely used method to solve combinatorial optimization problems. As many relevant ...
Local search is a widely used method to solve combinatorial optimization problems. As many relevant ...
Local search is a widely used method to solve combinatorial optimization problems. As many relevant ...
Local search is a widely used method to solve combinatorial optimization problems. As many relevant ...
Local search is a widely used method to solve combinatorial optimization problems. As many relevant ...
Local search is a widely used method to solve combinatorial optimization problems. As many relevant ...
Local search has been applied successfully to a diverse collection of optimization problems. It's ap...
Local search has been applied successfully to a diverse collection of optimization problems. It's ap...
Local search has been applied successfully to a diverse collection of optimization problems. It's ap...
178 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2002.The properties of polynomiall...
A drawback to using local search algorithms to address NP-hard discrete optimization problems is tha...
International audienceThis chapter sets up a formal framework for local search and provides a certai...
Many discrete optimization problems of practical interest cannot be solved to optimality in the avai...
Local search algorithms for combinatorial optimization problems are in general of pseudopolynomial r...
We investigate the complexity of finding locally optimal solutions to NP-hard com-binatorial optimiz...
Local search is a widely used method to solve combinatorial optimization problems. As many relevant ...
Local search is a widely used method to solve combinatorial optimization problems. As many relevant ...
Local search is a widely used method to solve combinatorial optimization problems. As many relevant ...
Local search is a widely used method to solve combinatorial optimization problems. As many relevant ...
Local search is a widely used method to solve combinatorial optimization problems. As many relevant ...
Local search is a widely used method to solve combinatorial optimization problems. As many relevant ...
Local search has been applied successfully to a diverse collection of optimization problems. It's ap...
Local search has been applied successfully to a diverse collection of optimization problems. It's ap...
Local search has been applied successfully to a diverse collection of optimization problems. It's ap...