The following pages link to Mehdi Mrad (Q336549):
Displayed 11 items.
- Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles (Q336550) (← links)
- An optimization-based heuristic for the machine reassignment problem (Q338859) (← links)
- Strong multi-commodity flow formulations for the asymmetric traveling salesman problem (Q724060) (← links)
- Two-stage bond portfolio optimization and its application to Saudi Sukuk Market (Q2173115) (← links)
- Some fixed point results on rectangular metric-like spaces endowed with a graph (Q2333961) (← links)
- Synchronous routing for personal rapid transit pods (Q2336598) (← links)
- Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements (Q2468776) (← links)
- Optimal solution of the discrete cost multicommodity network design problem (Q2518654) (← links)
- Allocating nodes to hubs for minimizing the hubs processing resources: A case study (Q5242266) (← links)
- Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates (Q6066663) (← links)
- Tight lower bounds for the traveling salesman problem with draft limits (Q6109566) (← links)