Manolis N. Kritikos

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

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2024

Valid inequalities for the non-unit demand capacitated minimum spanning tree problem with arc time windows and flow costs.

Manolis N. Kritikos, George Ioannou

Int. J. Prod. Res., January, 2024

2021

The capacitated minimum spanning tree problem with arc time windows.

Manolis N. Kritikos, George Ioannou

Expert Syst. Appl., 2021

2019

Two heuristics for the capacitated minimum spanning tree problem with time windows.

Manolis N. Kritikos, George Ioannou

J. Oper. Res. Soc., 2019

2017

A greedy heuristic for the capacitated minimum spanning tree problem.

Manolis N. Kritikos, George Ioannou

J. Oper. Res. Soc., 2017

A full ranking methodology in data envelopment analysis based on a set of dummy decision making units.

Manolis N. Kritikos

Expert Syst. Appl., 2017

2008

An assignment-based heuristic for vehicle routing with time windows.

George Ioannou, Manolis N. Kritikos, Gregory P. Prastacos

Oper. Res., 2008

2007

Sequencing material handling equipment in production facilities.

Manolis N. Kritikos, George Ioannou

Int. Trans. Oper. Res., 2007

2004

Optimization of material handling in production and warehousing facilities.

George Ioannou, Manolis N. Kritikos

Oper. Res., 2004

A synthesis of assignment and heuristic solutions for vehicle routing with time windows.

George Ioannou, Manolis N. Kritikos

J. Oper. Res. Soc., 2004

2002

Map-Route: a GIS-based decision support system for intra-city vehicle routing with time windows.

George Ioannou, Manolis N. Kritikos, Gregory P. Prastacos

J. Oper. Res. Soc., 2002

2001

A greedy look-ahead heuristic for the vehicle routing problem with time windows.

George Ioannou, Manolis N. Kritikos, Gregory P. Prastacos

J. Oper. Res. Soc., 2001