Given a graph with nonnegative edge weights and node pairs Q, we study the problem of constructing a minimum weight set of edges so that the induced subgraph contains at least K edge-disjoint paths containing at most L edges between each pair in Q. Using the layered representation introduced by...

In this paper, we consider the management of the return flows of empty logistic containers that accumulate at the customer’s sites. These containers must be brought back to the factories in order to sustain future expeditions. We consider a network composed of several factories and several...

We present a branch-and-cut algorithm to solve the single commodity uncapacitated fixed charge network flow problem, which includes the Steiner tree problem, uncapacitated lot-sizing problems, and the fixed charge transportation problem as special cases. The cuts used are simple dicut...

The Glossary for Transport Statistics was published for the first time in 1994 with the purpose of assisting member countries during the collection of data on transport using the Common Questionnaire developed by the United Nations Economic Commission for Europe, the International Transport...

The Glossary for transport statistics was published for the first time in 1994 with the purpose of assisting member countries during the collection of data on transport using the Common Questionnaire developed by the UNECE, the International Transport Forum and Eurostat. It has since evolved to...

Le Glossaire des statistiques de transport a été publié pour la première fois en 1994 afin d’aider les pays membres dans la collecte de données sur le transport effectuée au moyen du Questionnaire commun mis au point par la CEE-ONU, le FIT et Eurostat. Depuis lors, il a évolué pour...