Ocotlán Díaz-Parra

Orcid: 0000-0002-8740-3747

According to our database1, Ocotlán Díaz-Parra authored at least 61 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Quality of Service in Sustainable Development: A QoS-based Analysis of the United Nations Sustainable Development Goals.
Int. J. Comb. Optim. Probl. Informatics, 2024

Innovating in the Detection of Depression in Young Adults: Development of a Mobile Application Based on the Enhanced Cascade Model.
Int. J. Comb. Optim. Probl. Informatics, 2024

2023
Editorial: A Brief Panorama of Water Smart Cities.
Int. J. Comb. Optim. Probl. Informatics, 2023

Soccer Training Scheduling Problem.
Int. J. Comb. Optim. Probl. Informatics, 2023

Complexity on Fuzzy set and Fuzzy Logic for Air Quality Complexity on Fuzzy set and Fuzzy Logic for Air Quality.
Int. J. Comb. Optim. Probl. Informatics, 2023

Smart White Cane for Visually Impaired People for Hearing Recreation in Tourist Environment.
Int. J. Comb. Optim. Probl. Informatics, 2023

2022
Editorial Comments about Safe Cities.
Int. J. Comb. Optim. Probl. Informatics, 2022

Bio-Inspired Algorithm for Coordinated Control in Mobile Devices.
Int. J. Comb. Optim. Probl. Informatics, 2022

Smart Education and future trends.
Int. J. Comb. Optim. Probl. Informatics, 2022

2021
The Hybrid Forecasting Method SVR-ESAR for Covid-19.
Int. J. Comb. Optim. Probl. Informatics, 2021

Editorial: P versus NP problem from Formal Languages Theory View.
Int. J. Comb. Optim. Probl. Informatics, 2021

Electronic system to monitoring vital signs in pregnancy through Random Forests.
Int. J. Comb. Optim. Probl. Informatics, 2021

2020
Predictive Investment Model in the Mexican Metallurgical Industry.
Int. J. Comb. Optim. Probl. Informatics, 2020

Communication of Mobile Devices with Bioinspired Algorithms.
Int. J. Comb. Optim. Probl. Informatics, 2020

Editorial for Volume 11 Number 2: Electric School Bus Routing Problem for Smart Cities.
Int. J. Comb. Optim. Probl. Informatics, 2020

Editorial for Volume 11 Number 3: Maritime Platform Transport Problem of Solid, Special, and Dangerous Waste.
Int. J. Comb. Optim. Probl. Informatics, 2020

Flight control mechanisms of a comet.
Int. J. Comb. Optim. Probl. Informatics, 2020

Review of control on agricultural robot tractors.
Int. J. Comb. Optim. Probl. Informatics, 2020

2019
Editorial for Volume 10 Number 3: Can Machines Play Musical Instruments?
Int. J. Comb. Optim. Probl. Informatics, 2019

Editorial for Volume 10 Number 1: Review of heuristic algorithms applied to the solution problem of land transportation of perishable products.
Int. J. Comb. Optim. Probl. Informatics, 2019

Editorial for Volume 10 Number 2: Surveying the Transportation of the E-Waste.
Int. J. Comb. Optim. Probl. Informatics, 2019

2018
Editorial for Volume 9 Number 3: Models, Resources and Activities of Project Scheduling Problems.
Int. J. Comb. Optim. Probl. Informatics, 2018

Editorial for Volume 9 Number 1: Eye Tracking Interfaces.
Int. J. Comb. Optim. Probl. Informatics, 2018

Forecast of the Wind Speed using the Regional Atmospheric Modeling System (RAMS) and Weather Research and Forecasting (WRF) models.
Int. J. Comb. Optim. Probl. Informatics, 2018

Intelligent Tutor System for the Learning of Otomí Language.
Int. J. Comb. Optim. Probl. Informatics, 2018

An Efficient Heuristic Applied to the K-means Algorithm for the Clustering of Large Highly-Grouped Instances.
Computación y Sistemas, 2018

2017
Editorial for Volume 8 Number 3 - Mexican Infant Mortality and the data-mining applied to the prediction of treatment of diseases.
Int. J. Comb. Optim. Probl. Informatics, 2017

Motivation Index to Improve the Soccer Performance.
Int. J. Comb. Optim. Probl. Informatics, 2017

Project Management for Farm Production.
Int. J. Comb. Optim. Probl. Informatics, 2017

Editorial for Volume 8 Number 1- Characterization in the Transfer of Resources to the International Space Station.
Int. J. Comb. Optim. Probl. Informatics, 2017

Oil Platform Transport Problem (OPTP) is NP-hard.
Int. J. Comb. Optim. Probl. Informatics, 2017

2016
Editorial for Volume 7 Number 1: The Space Transportation.
Int. J. Comb. Optim. Probl. Informatics, 2016

A Mathematical Model for Optimizing Resources of Scientific Projects.
Computación y Sistemas, 2016

2015
Editorial for Volume 6 Number 1: Dissemination of Academic Books on the Book Citation Index.
Int. J. Comb. Optim. Probl. Informatics, 2015

Editorial for Volume 6 Number 3-Computing Solutions inspired in Biology.
Int. J. Comb. Optim. Probl. Informatics, 2015

Editorial for Volume 6 Number 2: Books Content Manager of Open Access - Open Monograph Press.
Int. J. Comb. Optim. Probl. Informatics, 2015

TSP in Partitioning with Tabu Search.
Proceedings of the Advances in Artificial Intelligence and Its Applications, 2015

2014
A Survey of Transportation Problems.
J. Appl. Math., 2014

Strategic Planning for the Computer Security: A Practice Case of an Electrical Research Institute.
Int. J. Comb. Optim. Probl. Informatics, 2014

Soft Systems Methodology for the Strategic Planning of the Enterprise Computer Security.
Int. J. Comb. Optim. Probl. Informatics, 2014

2013
Vertical Transfer Algorithm for the School Bus Routing Problem.
Trans. Comput. Sci., 2013

Application of formal languages in polynomial transformations of instances between NP-complete problems.
J. Zhejiang Univ. Sci. C, 2013

Quality Function Deployment (QFD) House of Quality for Strategic Planning of Computer Security of SMEs.
Int. J. Comb. Optim. Probl. Informatics, 2013

2012
Meta-Heuristics Algorithms based on the Grouping of Animals by Social Behavior for the Traveling Salesman Problem.
Int. J. Comb. Optim. Probl. Informatics, 2012

A transgenic algorithm for the Vehicle Routing Problem with Time Windows.
Proceedings of the Fourth World Congress on Nature and Biologically Inspired Computing, 2012

A vertical transfer algorithm for the School Bus Routing Problem.
Proceedings of the Fourth World Congress on Nature and Biologically Inspired Computing, 2012

A Solution to the Strongly Correlated 0-1 Knapsack Problem by a Binary Branch and Bound Algorithm.
Proceedings of the Fifth International Joint Conference on Computational Sciences and Optimization, 2012

2011
Survey of polynomial transformations between NP-complete problems.
J. Comput. Appl. Math., 2011

Complexity Indicators applied to the Job Shop Scheduling Problem to discriminate the best Algorithm.
Int. J. Comb. Optim. Probl. Informatics, 2011

Editorial.
Int. J. Comb. Optim. Probl. Informatics, 2011

An Overview of the Theory of Instances Computational Complexity.
Int. J. Comb. Optim. Probl. Informatics, 2011

School Bus Routing Problem Library-SBRPLIB.
Int. J. Comb. Optim. Probl. Informatics, 2011

Similarities between meta-heuristics algorithms and the science of life.
Central Eur. J. Oper. Res., 2011

2010
A genetic distance metric to discriminate the selection of algorithms for the general ATSP problem.
J. Intell. Fuzzy Syst., 2010

Software Engineering applied to Manufacturing Problems.
Int. J. Comb. Optim. Probl. Informatics, 2010

Guideline of Identification and Track on Support's level on Mexican Very Small Enterprises (MVSE).
Int. J. Comb. Optim. Probl. Informatics, 2010

2009
Selection of an Investment Portfolio by Means of a Mathematical Model of Optimization Applied to Mexican Stock-Market in Period of Debacle.
Proceedings of the International Conference on Networked Computing and Advanced Information Management, 2009

MISMA: An Approach to Mexican Information Security Methodology and Architecture for PYMES.
Proceedings of the CONIELECOMP 2009, 2009

2008
A Metric to Discriminate the Selection of Algorithms for the General ATSP Problem.
Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2008

Applied Statistical Indicators to the Vehicle Routing Problem with Time Windows for Discriminate Appropriately the Best Algorithm.
Proceedings of the Computational Science and Its Applications - ICCSA 2008, International Conference, Perugia, Italy, June 30, 2008

Memetic Algorithm Based on a Constraint Satisfaction Technique for VRPTW.
Proceedings of the Artificial Intelligence and Soft Computing, 2008


  Loading...