P. Chu and J. Beasley. A Genetic Algorithm for the Set Partitioning Problem. Technical report, Imperial College, 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Application of a Hybrid Genetic Algorithm to Airline Crew.. - Levine (1996) (4 citations) (Correct)
....for solving constrained problems with genetic algorithms is warranted. Second, using an adaptive mutation rate or simulated annealing like move in the ROW heuristic to maintain diversity in the population in order to sustain the search warrants further investigation. Recently, Chu and Beasley [5] have shown that preprocessing the constraint matrix to reduce its size, as well as modifications to the fitness definition, parent selection method, and population replacement scheme lead to improved performance solving SPP problems. Acknowledgments Parts of this paper are based on my Ph.D. ....
P. Chu and J. Beasley. A Genetic Algorithm for the Set Partitioning Problem. Technical report, Imperial College, 1995.
Semidefinite Programming for Assignment and Partitioning Problems - Zhao (1996) (6 citations) (Correct)
....The linear programming relaxation is as follows (SPLP ) LP : min c t x subject to Ax = e x 0: To improve the approximate solution for (SPT) one can use cutting planes and or branch and bound techniques in conjunction with various bound improvement techniques. See chu and Beasley [CB95] for a literature survey on exact and heuristic algorithms for SP. We include the following related papers in the bibliography [AFST69, BF81, BH90, GER89, HT94, RF88] In this chapter, we develop an SDP relaxation for the set partitioning problem. In our approach, in addition to taking care of ....
P. C. CHU and J. E. BEASLEY. A genetic algorithm for the set partitioning problem. Technical report, Imperial College, The Management School, London, England, 1995. URL: http:/mscmga.ms.ic.ac.uk/pchu/pchu.html. 111
Semidefinite Programming Relaxations For Set Partitioning.. - Wolkowicz, Zhao (1996) (2 citations) (Correct)
....(SPLP ) LP : min c t x subject to Ax = e x 0: To improve the approximate solution for (SP) one can use cutting planes and or branch andbound techniques in conjunction with various bound improvement techniques. In addition, various heuristics have been tried. See Chu and Beasley [8] for a literature survey on exact and heuristic algorithms for (SP) We include the following related papers in the bibliography [1, 2, 5, 12, 13, 18] The latex bib file can be obtained over WWW or with anonymous ftp using URL: ftp: orion.uwaterloo.ca pub henry reports setpart.bib.gz. In this ....
P. C. CHU and J. E. BEASLEY. A genetic algorithm for the set partitioning problem. Technical report, Imperial College, The Management School, London, England, 1995. URL: http:/mscmga.ms.ic.ac.uk/pchu/pchu.html.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC