Petrovan, Adrian; Matei, Oliviu; Pop, Petrică C. A comparative study between haploid genetic algorithms and diploid genetic algorithms. (English) Zbl 07752894 Carpathian J. Math. 39, No. 2, 433-458 (2023). MSC: 65L10 65L12 65L20 65L70 PDFBibTeX XMLCite \textit{A. Petrovan} et al., Carpathian J. Math. 39, No. 2, 433--458 (2023; Zbl 07752894) Full Text: DOI
Cosma, Ovidiu; Pop, Petrică C.; Pop Sitar, Cosmina A two-level based genetic algorithm for solving the soft-clustered vehicle routing problem. (English) Zbl 1524.90267 Carpathian J. Math. 38, No. 1, 117-128 (2022). MSC: 90C27 90C59 68T20 PDFBibTeX XMLCite \textit{O. Cosma} et al., Carpathian J. Math. 38, No. 1, 117--128 (2022; Zbl 1524.90267) Full Text: DOI
Cosma, Ovidiu; Pop, Petrică C.; Zelina, Ioana A novel genetic algorithm for solving the clustered shortest-path tree problem. (English) Zbl 1499.90278 Carpathian J. Math. 36, No. 3, 401-414 (2020). MSC: 90C59 05C85 68T20 05C38 05C12 PDFBibTeX XMLCite \textit{O. Cosma} et al., Carpathian J. Math. 36, No. 3, 401--414 (2020; Zbl 1499.90278) Full Text: DOI
Cosma, Ovidiu; Pop, Petrică C.; Pop Sitar, Corina An efficient iterated local search heuristic algorithm for the two-stage fixed-charge transportation problem. (English) Zbl 1463.90010 Carpathian J. Math. 35, No. 2, 153-164 (2019). MSC: 90B06 90C08 90C59 PDFBibTeX XMLCite \textit{O. Cosma} et al., Carpathian J. Math. 35, No. 2, 153--164 (2019; Zbl 1463.90010)
Pop, Petrică C.; Sabo, Cosmin; Biesinger, Benjamin; Hu, Bin; Raidl, Günther R. Solving the two-stage fixed-charge transportation problem with a hybrid genetic algorithm. (English) Zbl 1399.90027 Carpathian J. Math. 33, No. 3, 365-371 (2017). MSC: 90B06 90B05 90C08 90C59 PDFBibTeX XMLCite \textit{P. C. Pop} et al., Carpathian J. Math. 33, No. 3, 365--371 (2017; Zbl 1399.90027)
Pop, Petrica Claudiu; Matei, Oliviu; Pop Sitar, Corina; Zelina, Ioana A hybrid based genetic algorithm for solving a capacitated fixed-charge transportation problem. (English) Zbl 1399.90028 Carpathian J. Math. 32, No. 2, 225-232 (2016). MSC: 90B06 90C59 90B05 90C26 PDFBibTeX XMLCite \textit{P. C. Pop} et al., Carpathian J. Math. 32, No. 2, 225--232 (2016; Zbl 1399.90028)
Pop, Petrică C.; Pop Sitar, Corina New models of the generalized fixed-charge network design problem. (English) Zbl 1265.90219 Carpathian J. Math. 28, No. 1, 143-150 (2012). MSC: 90C10 90C11 90B18 90C27 65K05 PDFBibTeX XMLCite \textit{P. C. Pop} and \textit{C. Pop Sitar}, Carpathian J. Math. 28, No. 1, 143--150 (2012; Zbl 1265.90219)
Pop, P. C. A survey of different integer programming formulations of the generalized minimum spanning tree problem. (English) Zbl 1183.90343 Carpathian J. Math. 25, No. 1, 104-118 (2009). MSC: 90C27 90C10 90C11 PDFBibTeX XMLCite \textit{P. C. Pop}, Carpathian J. Math. 25, No. 1, 104--118 (2009; Zbl 1183.90343)
Pintea, Camelia M.; Dumitrescu, D.; Pop, P. C. Combining heuristics and modifying local information to guide ant-based search. (English) Zbl 1174.90011 Carpathian J. Math. 24, No. 1, 94-103 (2008). Reviewer: Svetlana A. Kravchenko (Minsk) MSC: 90C27 68T20 PDFBibTeX XMLCite \textit{C. M. Pintea} et al., Carpathian J. Math. 24, No. 1, 94--103 (2008; Zbl 1174.90011)
Pop, Petrică C.; Horvat Marc, Andrei; Pop Sitar, Corina At least version of the generalized minimum spanning tree problem. (English) Zbl 1150.05311 Carpathian J. Math. 22, No. 1-2, 129-135 (2006). MSC: 05C05 68R10 90C05 90C10 90C27 90C39 PDFBibTeX XMLCite \textit{P. C. Pop} et al., Carpathian J. Math. 22, No. 1--2, 129--135 (2006; Zbl 1150.05311)
Pop, Petrică C.; Zelina, Ioana; Pop Sitar, Corina Efficient algorithms for the generalized minimum spanning tree problem. (English) Zbl 1083.90043 Carpathian J. Math. 20, No. 1, 109-117 (2004). MSC: 90C35 05C05 PDFBibTeX XMLCite \textit{P. C. Pop} et al., Carpathian J. Math. 20, No. 1, 109--117 (2004; Zbl 1083.90043)