机译:New formulations and branch-and-cut procedures for the longest induced path problem
Univ Fed Fluminense, Inst Comp, BR-24210240 Niteroi, RJ, Brazil;
Univ Fed Bahia, Inst Comp, BR-40170115 Salvador, BA, Brazil;
Univ Fed Ceara, Campus Russas,Rua Felipe Santiago, BR-62900000 Russas, CE, Brazil;
Combinatorial optimization; Integer programming; Longest induced path; Maximum induced subgraphs; Maximum cardinality;