Research Article

On the Performance of Heuristics on Finite and Infinite Fractal Instances of the Euclidean Traveling Salesman Problem

Pages:121–132

Published Online:May 1, 1998

https://doi.org/10.1287/ijoc.10.2.121

Solving the Orienteering Problem through Branch-and-Cut

Pages:133–148

Published Online:May 1, 1998

https://doi.org/10.1287/ijoc.10.2.133

An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems

Pages:149–162

Published Online:May 1, 1998

https://doi.org/10.1287/ijoc.10.2.149

Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems

Pages:163–179

Published Online:May 1, 1998

https://doi.org/10.1287/ijoc.10.2.163

Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints

Pages:180–188

Published Online:May 1, 1998

https://doi.org/10.1287/ijoc.10.2.180

On Formal Semantics and Analysis of Typed Modeling Languages: An Analysis of Ascend

Pages:189–208

Published Online:May 1, 1998

https://doi.org/10.1287/ijoc.10.2.189

Feature Selection via Mathematical Programming

Pages:209–217

Published Online:May 1, 1998

https://doi.org/10.1287/ijoc.10.2.209

Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control

Pages:218–235

Published Online:May 1, 1998

https://doi.org/10.1287/ijoc.10.2.218

Variance Reduction and Objective Function Evaluation in Stochastic Linear Programs

Pages:236–247

Published Online:May 1, 1998

https://doi.org/10.1287/ijoc.10.2.236

Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems

Pages:248–260

Published Online:May 1, 1998

https://doi.org/10.1287/ijoc.10.2.248

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.