Manolis N. Kritikos

Orcid: 0000-0002-4687-4171

According to our database1, Manolis N. Kritikos authored at least 13 papers between 2001 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Valid inequalities for the non-unit demand capacitated minimum spanning tree problem with arc time windows and flow costs.
Int. J. Prod. Res., January, 2024

The cumulative vehicle routing problem with arc time windows.
Expert Syst. Appl., 2024

A common weights multiplicative aggregation approach for composite indicators: the case of Global City Competitiveness Index.
Expert Syst. Appl., 2024

2021
The capacitated minimum spanning tree problem with arc time windows.
Expert Syst. Appl., 2021

2019
Two heuristics for the capacitated minimum spanning tree problem with time windows.
J. Oper. Res. Soc., 2019

2017
A greedy heuristic for the capacitated minimum spanning tree problem.
J. Oper. Res. Soc., 2017

A full ranking methodology in data envelopment analysis based on a set of dummy decision making units.
Expert Syst. Appl., 2017

2008
An assignment-based heuristic for vehicle routing with time windows.
Oper. Res., 2008

2007
Sequencing material handling equipment in production facilities.
Int. Trans. Oper. Res., 2007

2004
Optimization of material handling in production and warehousing facilities.
Oper. Res., 2004

A synthesis of assignment and heuristic solutions for vehicle routing with time windows.
J. Oper. Res. Soc., 2004

2002
Map-Route: a GIS-based decision support system for intra-city vehicle routing with time windows.
J. Oper. Res. Soc., 2002

2001
A greedy look-ahead heuristic for the vehicle routing problem with time windows.
J. Oper. Res. Soc., 2001


  Loading...