C
Cynthia Barnhart
Researcher at Massachusetts Institute of Technology
Publications - 126
Citations - 11489
Cynthia Barnhart is an academic researcher from Massachusetts Institute of Technology. The author has contributed to research in topics: Schedule & Integer programming. The author has an hindex of 47, co-authored 125 publications receiving 10559 citations. Previous affiliations of Cynthia Barnhart include Georgia Institute of Technology.
Papers
More filters
Journal ArticleDOI
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Cynthia Barnhart,Ellis L. Johnson,George L. Nemhauser,Martin W. P. Savelsbergh,Pamela H. Vance +4 more
TL;DR: In this paper, column generation methods for integer programs with a huge number of variables are discussed, including implicit pricing of nonbasic variables to generate new columns or to prove LP optimality at a node of the branch-and-bound tree.
Journal ArticleDOI
Consumption Self-Control by Rationing Purchase Quantities of Virtue and Vice
TL;DR: In this paper, the authors use multiple empirical methods to show that consumers voluntarily and strategically ration their purchase quantities of goods that are likely to be consumed on impulse and that therefore may pose self-control problems.
BookDOI
The global airline industry
TL;DR: In this article, Belobaba et al. present an overview of the Global Airline Industry and its role in the air travel industry, including the role of labor relations and human resource management.
Journal ArticleDOI
The fleet assignment problem: Solving a large-scale integer program
Christopher A. Hane,Cynthia Barnhart,Ellis L. Johnson,Roy E. Marsten,George L. Nemhauser,Gabriele Sigismondi +5 more
TL;DR: This model of the fleet assignment problem is a large multi-commodity flow problem with side constraints defined on a time-expanded network, and the algorithm found solutions with a maximum optimality gap of 0.02% and is more than two orders of magnitude faster than using default options of a standard LP-based branch-and-bound code.
Journal ArticleDOI
Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems
TL;DR: A new branching rule is devised that allows columns to be generated efficiently at each node of the branch-and-bound tree and cuts are described that help to strengthen the linear programming relaxation and to mitigate the effects of problem symmetry.