Black box scatter search for general classes of binary optimization problems

@article{Gortzar2010BlackBS,
  title={Black box scatter search for general classes of binary optimization problems},
  author={Francisco Gort{\'a}zar and Abraham Duarte and Manuel Laguna and Rafael Mart{\'i}},
  journal={Computers & OR},
  year={2010},
  volume={37},
  pages={1977-1986}
}
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represented as binary vectors and that may or may not include constraints. Binary problems arise in a variety of settings, including engineering design and statistical mechanics (e.g., the spin glass problem). A distinction is made between two sets of general constraint types that are handled directly by the solver and other… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS
16 Citations
27 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 27 references

Heuristics Algorithm for the Maximum Diverstity Problem,

  • M. Gallego, A. Duarte, M. Laguna, R. Martí
  • Computational Optimization and Application,
  • 2008
3 Excerpts

Similar Papers

Loading similar papers…