# Modelling the Incomplete Intermodal Terminal Location Problem

## TL;DR

This paper introduces an incomplete intermodal terminal location problem, extending classical models by relaxing graph completeness, and provides mixed integer programming formulations validated with computational experiments.

## Contribution

It presents a novel incomplete version of the intermodal terminal location problem and develops new mixed integer programming models for it.

## Key findings

- Models are effectively solved using CPLEX.
- Numerical results demonstrate the models' applicability.
- Extensions improve modeling flexibility.

## Abstract

In this paper, we introduce and study the incomplete version of the intermodal terminal location problem. It's a generalization of the classical version by relaxing the assumption that the induced graph by located terminals is complete. We propose a mixed integer program to model the problem and we provide several extensions. All models are tested through validation in CPLEX solver. Numerical results are reported using well-known data set from the literature.