Pamela H. Vance

13 papers B 1Journal 11
YearRankTypeTitle / Venue / Authors
2009 — ch.
Multicommodity Flow Problems.
Encyclopedia of Optimization
Cynthia Barnhart, Niranjan Krishnan, Pamela H. Vance
2000 J jnl
Railroad Blocking: A Network Design Application.
Oper. Res.
Cynthia Barnhart, Hong Jin, Pamela H. Vance
2000 J jnl
Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems.
Oper. Res.
Cynthia Barnhart, Christopher A. Hane, Pamela H. Vance
1998 J jnl
Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem.
Comput. Optim. Appl.
Pamela H. Vance
1998 J jnl
Branch-and-Price: Column Generation for Solving Huge Integer Programs.
Oper. Res.
Cynthia Barnhart, Ellis L. Johnson, George L. Nemhauser, Martin W. P. Savelsbergh, Pamela H. Vance
1998 J jnl
Constructing Railroad Blocking Plans to Minimize Handling Costs.
Transp. Sci.
Harry N. Newton, Cynthia Barnhart, Pamela H. Vance
1998 J jnl
Optimal facility layout design.
Oper. Res. Lett.
Russell D. Meller, Venkat Narayanan, Pamela H. Vance
1997 J jnl
Airline Crew Scheduling: A New Formulation and Decomposition Algorithm.
Oper. Res.
Pamela H. Vance, Cynthia Barnhart, Ellis L. Johnson, George L. Nemhauser
1996 B conf
Integer Muticommodity Flow Problems.
IPCO
Cynthia Barnhart, Christopher A. Hane, Pamela H. Vance
1994 J jnl
Lifted cover facets of the 0-1 knapsack polytope with GUB constraints.
Oper. Res. Lett.
George L. Nemhauser, Pamela H. Vance
1994 J jnl
Solving binary cutting stock problems by column generation and branch-and-bound.
Comput. Optim. Appl.
Pamela H. Vance, Cynthia Barnhart, Ellis L. Johnson, George L. Nemhauser
1993 J jnl
Formulating a Mixed Integer Programming Problem to Improve Solvability.
Oper. Res.
Cynthia Barnhart, Ellis L. Johnson, George L. Nemhauser, Gabriele Sigismondi, Pamela H. Vance
1993 J jnl
Knapsack Problems: Algorithms and Computer Implementations (S. Martello and P. Toth).
SIAM Rev.
Pamela H. Vance