Sciweavers

68
Voted
INFORMS
2007
69views more  INFORMS 2007»
15 years 10 days ago
Dynamic Programming to Minimize the Maximum Number of Open Stacks
Maria Garcia de la Banda, Peter J. Stuckey
66
Voted
INFORMS
2007
45views more  INFORMS 2007»
15 years 10 days ago
Validation Sequence Optimization: A Theoretical Approach
Gediminas Adomavicius, Alexander Tuzhilin
INFORMS
2007
83views more  INFORMS 2007»
15 years 10 days ago
Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP)
William J. Cook, Daniel G. Espinoza, Marcos Goycoo...
76
Voted
INFORMS
2007
63views more  INFORMS 2007»
15 years 10 days ago
A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
Jeffrey W. Ohlmann, Barrett W. Thomas
88
Voted
INFORMS
2007
77views more  INFORMS 2007»
15 years 10 days ago
Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem
Ravindra K. Ahuja, Krishna C. Jha, James B. Orlin,...
INFORMS
2007
52views more  INFORMS 2007»
15 years 10 days ago
An Optimization Framework for Conformal Radiation Treatment Planning
Gino J. Lim, Michael C. Ferris, Stephen J. Wright,...
INFORMS
2007
50views more  INFORMS 2007»
15 years 10 days ago
Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
Johannes O. Royset, R. Kevin Wood