human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "improved squeaky wheel optimisation for driver scheduling"):
  Abstract: This paper presents a technique called Improved Squeaky Wheel Optimisation (ISWO) for driver scheduling problems. It improves the original Squeaky Wheel Optimisation's (SWO) effectiveness and execution speed by incorporating two additional steps of Selection and Mutation which implement evolution within a single solution. In the ISWO, a cycle of Analysis-Selection-Mutation-Prioritization-Construction continues until stopping conditions are reached. The Analysis step first computes the fitness of a current solution to identify troublesome components. The Selection step then discards these troublesome components probabilistically by using the fitness measure, and the Mutation step follows to further discard a small number of components at random. After the above steps, an input solution becomes partial and thus the resulting partial solution needs to be repaired. The repair is carried out by using the Prioritization step to first produce priorities that determine an order by which the following Construction step then schedules the remaining components. Therefore, the optimisation in the ISWO is achieved by solution disruption, iterative improvement and an iterative constructive repair process performed. Encouraging experimental results are reported.

Includes members:
  Member "an estimation of distribution algorithm for nurse scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a component based heuristic search method with evolutionary eliminations")
  Member "an indirect genetic algorithm for a nurse scheduling problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a greedy double swap heuristic for nurse scheduling")
  Member "building better nurse scheduling algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "solving nurse scheduling problem using constraint programming technique")
  Member "an indirect genetic algorithm for set covering problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "chemical reaction optimization for the set covering problem")
  Member "exploiting problem structure in a genetic algorithm approach to a nurse rostering problem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "solving nurse scheduling problem using constraint programming technique")
  Member "squeaky wheel optimization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "dr fill crosswords and an implemented solver for singly weighted csps")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.NE(Neural and Evolutionary Computing)