1. C.C. Aggarwal, J.B. Orlin, and R.P. Tai. Optimized crossover for the independent set problem. Operations Research, 45 (2): 226–234, 1997.
2. M.F. Arguello, T.A. Feo, and O. Goldschmidt. Randomized methods for the number partitioning problem. Computers & Operations Research,23(2):103111,1996.
3. E. Balas and W. Niehaus. Finding large cliques in arbitrary graphs by bipartite matching. In D.S. Johnson and M.A. Trick, editors, Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, volume DIMACS 26, pages 29–51. American Mathematical Society, 1996.
4. R. Berretta and P. Moscato. The number partitioning problem: An open challenge for evolutionary computation? In D. Come, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 261–278. McGraw-Hill, 1999.
5. A. Caprara and M. Fischetti. Branch-and-cut algorithms. In M. Dell’Amico, F. Maffioli, and S. Martello, editors, Annotated bibliographies in combinatorial optimization, pages 45 — 63. John Wiley and Sons, Chichester, 1997.