David Alcaide López de Pablo

Orcid: 0000-0001-9056-2194

According to our database1, David Alcaide López de Pablo authored at least 14 papers between 2002 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An inventory model with price- and stock-dependent demand and time- and stock quantity-dependent holding cost under profitability maximization.
Comput. Oper. Res., 2024

2022
Optimization of an inventory system with partial backlogging from a financial investment perspective.
Int. Trans. Oper. Res., 2022

An inventory system with time-dependent demand and partial backordering under return on inventory investment maximization.
Comput. Oper. Res., 2022

2021
Maximization of the return on inventory management expense in a system with price- and stock-dependent demand rate.
Comput. Oper. Res., 2021

2018
An inventory system with demand dependent on both time and price assuming backlogged shortages.
Eur. J. Oper. Res., 2018

2017
Locating names on vertices of a transaction network.
Eur. J. Oper. Res., 2017

2014
A new multicriteria approach for the analysis of efficiency in the Spanish olive oil sector by modelling decision maker preferences.
Eur. J. Oper. Res., 2014

2010
Complexity of cyclic scheduling problems: A state-of-the-art survey.
Comput. Ind. Eng., 2010

2009
A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows.
Eur. J. Oper. Res., 2009

2007
Cyclic multiple-robot scheduling with time-window constraints using a critical path approach.
Eur. J. Oper. Res., 2007

Multi-attribute Text Classification Using the Fuzzy Borda Method and Semantic Grades.
Proceedings of the Applications of Fuzzy Sets Theory, 2007

Fuzzifying Clustering Algorithms: The Case Study of MajorClust.
Proceedings of the MICAI 2007: Advances in Artificial Intelligence, 2007

2006
Network flow approaches to pre-emptive open-shop scheduling problems with time-windows.
Eur. J. Oper. Res., 2006

2002
An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns.
Eur. J. Oper. Res., 2002


  Loading...