121 | -- | 132 | Pablo Moscato, Michael G. Norman. On the Performance of Heuristics on Finite and Infinite Fractal Instances of the Euclidean Traveling Salesman Problem |
133 | -- | 148 | Matteo Fischetti, Juan José Salazar González, Paolo Toth. Solving the Orienteering Problem through Branch-and-Cut |
149 | -- | 162 | Andreas T. Ernst, Mohan Krishnamoorthy. An Exact Solution Approach Based on Shortest-Paths for ::::p::::-Hub Median Problems |
163 | -- | 179 | Yu-Li Chou, H. Edwin Romeijn, Robert L. Smith. Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems |
180 | -- | 188 | Luis Gouveia. Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints |
189 | -- | 208 | Hemant K. Bhargava, Ramayya Krishnan, Peter Piela. On Formal Semantics and Analysis of Typed Modeling Languages: An Analysis of Ascend |
209 | -- | 217 | Paul S. Bradley, Olvi L. Mangasarian, W. Nick Street. Feature Selection via Mathematical Programming |
218 | -- | 235 | Jonathan Eckstein, Michael C. Ferris. Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control |
236 | -- | 247 | Julia L. Higle. Variance Reduction and Objective Function Evaluation in Stochastic Linear Programs |
248 | -- | 260 | István Maros, Gautam Mitra. Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems |