## Integrated Pricing and Routing on a Network

We consider an integrated pricing and routing problem on a network. The problem is motivated by applications in freight transportation such as package delivery and less-than-truckload shipping services. The decision maker sets a price for each origin-destination pair of the network, which determines the demand flow that needs to be served. The flows are then … Read more

## A Combinatorial Algorithm for the Multi-commodity Flow Problem

This paper researches combinatorial algorithms for the multi-commodity flow problem. We relax the capacity constraints and introduce a \emph{penalty function} $$h$$ for each arc. If the flow exceeds the capacity on arc $$a$$, arc $$a$$ would have a penalty cost. Based on the \emph{penalty function} $$h$$, a new conception , \emph{equilibrium pseudo-flow}, is introduced. Then … Read more

## A Combinatorial Algorithm for the Multi-commodity Flow Problem

This paper researches combinatorial algorithms for the multi-commodity flow problem. We relax the capacity constraints and introduce a \emph{penalty function} $$h$$ for each arc. If the flow exceeds the capacity on arc $$a$$, arc $$a$$ would have a penalty cost. Based on the \emph{penalty function} $$h$$, a new conception , \emph{equilibrium pseudo-flow}, is introduced. Then … Read more

## Flow formulations for curriculum-based course timetabling

In this paper we present two mixed-integer programming formulations for the curriculum based course timetabling problem (CTT). We show that the formulations contain underlying network structures by dividing the CTT into two separate models and then connect the two models using flow formulation techniques. The first mixed-integer programming formulation is based on an underlying minimum … Read more

## A Parallel Local Search Framework for the Fixed-Charge Multicommodity Network Flow Problem

We present a parallel local search approach for obtaining high quality solutions to the Fixed Charge Multi-commodity Network Flow problem (FCMNF). The approach proceeds by improving a given feasible solution by solving restricted instances of the problem where flows of certain commodities are fixed to those in the solution while the other commodities are locally … Read more