External Links

    Journal: INFORMS Journal on Computing

    Volume 10, Issue 4

    359 -- 383Hemant K. Bhargava, Ramayya Krishnan. Feature Article - The World Wide Web: Opportunities for Operations Research and Management Science
    384 -- 387Gordon H. Bradley, Arnold H. Buss. Commentary - Dynamic, Distributed, Platform Independent OR/MS Applications - A Network Perspective
    388 -- 389Robert Fourer. Commentary - Predictions for Web Technologies in Optimization
    390 -- 392Arthur M. Geoffrion. Commentary - A New Horizon for OR/MS
    393 -- 395Michael Trick. ]ary - The World Wide Web: It s the Customers
    396 -- 398Hemant K. Bhargava, Ramayya Krishnan. Rejoinder - OR/MS, Electronic Commerce, and the Virtual INFORMS Community
    399 -- 416Sumit Sarkar, Deb Ghosh. Partitioning the Attribute Set for a Probabilistic Reasoning System
    417 -- 426E. Andrew Boyd, Rusty Burlingame, Kenneth Lindsay. An Efficient Algorithm for Solving an Air Traffic Management Model of the National Airspace System
    427 -- 437Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh. Lifted Cover Inequalities for 0-1 Integer Programs: Computation
    438 -- 447E. C. Sewell. A Branch and Bound Algorithm for the Stability Number of a Sparse Graph
    448 -- 458Carl M. Harris, William G. Marchal. Distribution Estimation Using Laplace Transforms
    459 -- 460Bruce L. Golden. Appreciation to Referees

    Volume 10, Issue 3

    261 -- 264H. Paul Williams, John M. Wilson. Connections Between Integer Linear Programming and Constraint Logic Programming - An Overview and Introduction to the Cluster of Articles
    265 -- 275Les G. Proll, Barbara Smith. Integer Linear Programming and Constraint Programming Approaches to a Template Design Problem
    276 -- 286Ken Darby-Dowman, James Little. Properties of Some Combinatorial Optimization Problems and Their Effect on the Performance of Integer Programming and Constraint Logic Programming
    287 -- 300Alexander Bockmayr, Thomas Kasper. Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
    301 -- 308Hachemi Bennaceur, Idir Gouachi, Gérard Plateau. An Incremental Branch-and-Bound Method for the Satisfiability Problem
    309 -- 322Ram D. Gopal, Paulo B. Goes, Robert S. Garfinkel. Interval Protection of Confidential Information in a Database
    323 -- 330José H. Dulá, Richard V. Helgason, N. Venugopal. An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull
    331 -- 340Rajeev Motwani, Vijay A. Saraswat, Eric Torng. Online Scheduling with Lookahead: Multipass Assembly Lines
    341 -- 350H. A. J. Crauwels, C. N. Potts, Luk N. Van Wassenhove. Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem

    Volume 10, Issue 2

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

    Volume 10, Issue 1

    1 -- 11Geir Dahl, Mechthild Stoer. A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems
    12 -- 24Michael R. Bartolacci, S. David Wu. A Virtual Clustering Approach for Routing Problems in Telecommunication Networks
    25 -- 39Frederick Kaefer, June S. Park. Interconnecting LANs and a FDDI Backbone Using Transparent Bridges: A Model and Solution Algorithms
    40 -- 55Sabyasachi Mitra, Ishwar Murthy. A Dual Ascent Procedure with Valid Inequalities for Designing Hierarchical Network Topologies
    56 -- 71Matthew J. Realff, George Stephanopoulos. On the Application of Explanation-Based Learning to Acquire Control Knowledge for Branch and Bound Algorithms
    72 -- 81Marne C. Cario, Barry L. Nelson. Numerical Methods for Fitting and Simulating Autoregressive-to-Anything Processes
    82 -- 93Gianfranco Ciardo, Joshua Gluckman, David M. Nicol. Distributed State Space Generation of Discrete-State Stochastic Models
    94 -- 106Enver Yücesan, Lee W. Schruben. Complexity of Simulation Models: A Graph Theoretic Approach
    107 -- 113Edward Rothberg, Bruce Hendrickson. Sparse Matrix Ordering Methods for Interior Point Linear Programming
    114 -- 120R. Armstrong, S. Gu, L. Lei. An Efficient Algorithm for a Class of Two-Resource Allocation Problems
    runs on