human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "solving the team orienteering problem with cutting planes"
  Abstract: The Team Orienteering Problem (TOP) is an attractive variant of the Vehicle Routing Problem (VRP). The aim is to select customers and at the same time organize the visits for a vehicle fleet so as to maximize the collected profits and subject to a travel time restriction on each vehicle.In this paper, we investigate the effective use of a linear formulation with polynomial number of variables to solve TOP. Cutting planes are the core components of our solving algorithm. It is first used to solve smaller and intermediate models of the original problem by considering fewer vehicles. Useful information are then retrieved to solve larger models, and eventually reaching the original problem. Relatively new and dedicated methods for TOP, such as identification of irrelevant arcs and mandatory customers, clique and independent-set cuts based on the incompatibilities, and profit/customer restriction on subsets of vehicles, are introduced.We evaluated our algorithm on the standard benchmark of TOP. The results show that the algorithm is competitive and is able to prove the optimality for 12 instances previously unsolved. HighlightsWe propose an efficient cutting plane algorithm for the Team Orienteering Problem.Information retrieved from solving smaller and modified models is shown to be useful.The graphs of incompatibilities are exploited to construct strong cuts.The experimental result is competitive and complementary to those of the literature.12 previously unsolved benchmark instances are now solved to optimality.

Connected through hyperedge HE-1 (induced by source paper "a cutting plane algorithm for the steiner team orienteering problem"):
  with members:
    - "a branch and cut algorithm for minimum spanning trees under conflict constraints"

Question: Please tell me which class the center node 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.RO(Robotics)