Wireless communication is used in many different situations such as mobile telephony, radio and TV broadcasting, satellite communication, and military operations. In each of these situations aâ€¦ (More)

NP{hard cases of the single{item capacitated lot{sizing problem have been the topic of extensive research and continue to receive considerable attention. However, surprisingly few theoretical resultsâ€¦ (More)

We consider the single-item discrete lot-sizing and scheduling problem. We present a partial linear description of the convex hull of feasible solutions that solves this problem in the presence ofâ€¦ (More)

ManyNP-hard graph problems can be solved in polynomial time for graphs with bounded treewidth. Equivalent results are known for pathwidth and branchwidth. In recent years, several studies have shownâ€¦ (More)

Absact Network loading problems occur in the design of telecommunication networks, in many different settings. The polyhedral structure of this problem is important in developing solution methods forâ€¦ (More)

Combinatorial optimization problems appear in many disciplines ranging from management and logistics to mathematics, physics, and chemistry. These problems are usually relatively easy to formulateâ€¦ (More)

In this paper we consider the problem of routing trains through railway stations. This problem occurs as a subproblem in a project which the authors are carrying out in cooperation with the Dutchâ€¦ (More)