Person:455035: Difference between revisions

From MaRDI portal
Person:455035
Created automatically from import231006081045
 
m AuthorDisambiguator moved page Petrică C. Pop to Petrică C. Pop: Duplicate
 
(No difference)

Latest revision as of 23:56, 11 December 2023

Available identifiers

zbMath Open pop.petrica-claudiuMaRDI QIDQ455035

List of research outcomes





PublicationDate of PublicationType
A comprehensive survey on the generalized traveling salesman problem2024-06-17Paper
A two-level based genetic algorithm for solving the soft-clustered vehicle routing problem2023-10-20Paper
A Comparative Study between Haploid Genetic Algorithms and Diploid Genetic Algorithms2023-10-20Paper
Influence of context availability and soundness in predicting soil moisture using the Context-Aware Data Mining approach2023-09-13Paper
Solving a Two-stage Supply Chain Network Design Problem with Fixed Costs by a Hybrid Genetic Algorithm2022-08-26Paper
A novel genetic algorithm for solving the clustered shortest-path tree problem2021-12-15Paper
https://portal.mardi4nfdi.de/entity/Q51160372020-08-21Paper
https://portal.mardi4nfdi.de/entity/Q51160972020-08-21Paper
https://portal.mardi4nfdi.de/entity/Q51161162020-08-21Paper
A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes2020-06-04Paper
The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances2020-01-23Paper
A decomposition-based method for solving the clustered vehicle routing problem2019-06-24Paper
A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem2018-10-11Paper
https://portal.mardi4nfdi.de/entity/Q45693842018-06-28Paper
https://portal.mardi4nfdi.de/entity/Q45694392018-06-28Paper
A two-level solution approach for solving the generalized minimum spanning tree problem2017-11-23Paper
An Ant Algorithm for the Partition Graph Coloring Problem2016-06-22Paper
An improved hybrid ant-local search algorithm for the partition graph coloring problem2015-10-19Paper
Reducing the bandwidth of a sparse matrix with a genetic algorithm2014-10-24Paper
On the complexity of the selective graph coloring problem in some special classes of graphs2014-06-06Paper
A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem2014-04-25Paper
https://portal.mardi4nfdi.de/entity/Q46493502012-11-21Paper
Selective Graph Coloring in Some Special Classes of Graphs2012-11-02Paper
Generalized network design problems. Modeling and optimization.2012-10-04Paper
New mathematical models of the generalized vehicle routing problem and extensions2012-04-21Paper
https://portal.mardi4nfdi.de/entity/Q53922372011-04-08Paper
https://portal.mardi4nfdi.de/entity/Q36395582009-11-02Paper
https://portal.mardi4nfdi.de/entity/Q36386432009-10-27Paper
https://portal.mardi4nfdi.de/entity/Q33923972009-08-14Paper
Exact Algorithms for Generalized Combinatorial Optimization Problems2009-03-03Paper
https://portal.mardi4nfdi.de/entity/Q36053562009-02-23Paper
On the prize-collecting generalized minimum spanning tree problem2008-03-31Paper
A Sensitive Metaheuristic for Solving a Large Optimization Problem2008-03-07Paper
https://portal.mardi4nfdi.de/entity/Q54448112008-02-25Paper
https://portal.mardi4nfdi.de/entity/Q54214792007-10-22Paper
https://portal.mardi4nfdi.de/entity/Q53094652007-10-09Paper
https://portal.mardi4nfdi.de/entity/Q53089512007-10-08Paper
https://portal.mardi4nfdi.de/entity/Q34461822007-06-14Paper
https://portal.mardi4nfdi.de/entity/Q54755612006-06-27Paper
https://portal.mardi4nfdi.de/entity/Q53140952005-09-02Paper
New models of the generalized minimum spanning tree problem2005-01-17Paper
https://portal.mardi4nfdi.de/entity/Q44489192004-02-03Paper
https://portal.mardi4nfdi.de/entity/Q45156822000-11-22Paper

Research outcomes over time

This page was built for person: Petrică C. Pop