Rahimeh Neamatian Monemi

According to our database, Rahimeh Neamatian Monemi authored at least 9 papers between 2013 and 2023.

Collaborative distances:

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

2023

Dock assignment and truck scheduling problem; consideration of multiple scenarios with resource allocation constraints.

Rahimeh Neamatian Monemi, Shahin Gelareh

Comput. Oper. Res., 2023

2021

Bi-objective load balancing multiple allocation hub location: a compromise programming approach.

Rahimeh Neamatian Monemi, Shahin Gelareh, Anass Nagih, Dylan Jones

Ann. Oper. Res., 2021

2020

The selective traveling salesman problem with draft limits.

Shahin Gelareh, Bernard Gendron, Saïd Hanafi, Rahimeh Neamatian Monemi, Raca Todosijevic

J. Heuristics, 2020

2019

The capacitated single-allocation <i>p</i>-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach.

Kassem Danach, Shahin Gelareh, Rahimeh Neamatian Monemi

EURO J. Transp. Logist., 2019

2017

The Ring Spur Assignment Problem: New formulation, valid inequalities and a branch-and-cut approach.

Rahimeh Neamatian Monemi, Shahin Gelareh

Comput. Oper. Res., 2017

2016

A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints.

Shahin Gelareh, Rahimeh Neamatian Monemi, Frédéric Semet, Gilles Goncalves

Eur. J. Oper. Res., 2016

2015

Solution methods for scheduling of heterogeneous parallel machines applied to the workover rig problem.

Rahimeh Neamatian Monemi, Kassem Danach, Wissam Khalil, Shahin Gelareh, Francisco C. Lima Jr., Dario José Aloise

Expert Syst. Appl., 2015

2014

Fixed cardinality linear ordering problem, polyhedral studies and solution methods. (Problème d'ordre linéaire sous containte de cardinalité, étude polyédrale et méthodes de résolution).

Rahimeh Neamatian Monemi

PhD thesis, 2014

2013

Single string planning problem arising in liner shipping industries: A heuristic approach.

Shahin Gelareh, Rahimeh Neamatian Monemi, Philippe Mahey, Nelson Maculan, David Pisinger

Comput. Oper. Res., 2013