The field of statistical disclosure control aims to reduce the risk re-identifying an individual from disseminated data, a major concern among national agencies. Operations Research (OR) techniques have been widely used in past for protecting tabular but not microdata (i.e., files individuals and attributes). Few papers apply OR microaggregation problem, which is considered one best methods pro...

We present a branch-and-price-and-cut algorithm for solving large-scale instances of the multicommodity capacitated fixed-charge network design problem. The restricted master problem solved at each column generation iteration is obtained directly from the compact arc-based model by considering only a subset of the commodity flow variables. The pricing subproblem corresponds to a Lagrangian rela...

This paper presents a column generation algorithm for the Vehicle Routing Problem with Time Windows (VRPTW). Traditionally, column generation models of the VRPTW have consisted of a Set Partitioning master problem with each column representing a route, i.e., a resource feasible path starting and ending at the depot. Elementary routes (no customer visited more than once) have shown superior resu...

This paper presents a so-called Limited Column Generation technique for solving the Local Access Network Design and Expansion problems. We first define our models for the design problem and the expansion problem. Then, we formulate both problems into a tree-partitioning problem with exponential number of variables. Because its intersection graph is a chordal graph and, of course, a perfect grap...

The Dynamic, Resource-Constrained Shortest-Path Problem on an Acyclic Graph with Application in Column Generation and a Literature Review on Sequence-Dependent Scheduling. (December 2005) Xiaoyan Zhu, B.En., Tsinghua University; M.S., MIT & Nanyang Technological University; M.S., Texas A&M University Chair of Advisory Committee: Dr. Wilbert E. Wilhelm This dissertation discusses two independent...

In their paper, Avella et al. (2006) investigate a time-constrained routing problem. The core of the proposed solution approach is a large-scale linear program that grows both rowand column-wise when new variables are introduced. Thus, a column-and-row generation algorithm is proposed to solve this linear program optimally, and an optimality condition is presented to terminate the column-and-ro...