External Links

    Journal: INFORMS Journal on Computing

    Volume 11, Issue 4

    329 -- 344William J. Wolfe. A Fuzzy Hopfield-Tank Traveling Salesman Problem Model
    345 -- 357Andrea Lodi, Silvano Martello, Daniele Vigo. Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
    358 -- 369Vittorio Maniezzo. Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
    370 -- 393Antonio Frangioni, Giorgio Gallo. A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
    394 -- 405Joseph Abate, Ward Whitt. Computing Laplace Transforms for Numerical Inversion Via Continued Fractions
    406 -- 419Zeger Degraeve, Linus Schrage. Optimal Integer Solutions to Industrial Cutting Stock Problems
    420 -- 431Brett W. Schug, Matthew J. Realff. Propagation of Interval Values in Simple Processing Networks

    Volume 11, Issue 3

    217 -- 238Paul S. Bradley, Usama M. Fayyad, Olvi L. Mangasarian. Mathematical Programming for Data Mining: Formulations and Challenges
    239 -- 247Hemant K. Bhargava. Data Mining by Decomposition: Adaptive Search for Hypothesis Generation
    248 -- 257Siddhartha Bhattacharyya. Direct Marketing Performance Modeling Using Genetic Algorithms
    258 -- 266Selwyn Piramuthu. Feature Selection for Financial Credit-Risk Evaluation Decisions
    267 -- 277Akhil Kumar, Ignacio Olmeda. A Study of Composite or Hybrid Classifiers for Knowledge Discovery
    278 -- 291Michael V. Mannino, Vijay S. Mookerjee. Optimizing Expert Systems: Heuristics for Efficiently Generating Low-Cost Information Acquisition Strategies
    292 -- 298Igor Averbakh, Oded Berman. Parallel Complexity of Additive Location Problems
    299 -- 315Prabhudev Konana, Sudha Ram. Semantics-Based Transaction Processing for Real-Time Databases: The Case of Automated Stock Trading
    316 -- 327Harvey J. Greenberg. Matrix Sensitivity Analysis from an Interior Solution of a Linear Program

    Volume 11, Issue 2

    125 -- 137Alberto Caprara, David Pisinger, Paolo Toth. Exact Solution of the Quadratic Knapsack Problem
    138 -- 148William Cook, André Rohe. Computing Minimum-Weight Perfect Matchings
    149 -- 160Jeffery L. Kennington, Jason E. Whitler. An Efficient Decomposition Algorithm to Optimize Spare Capacity in a Telecommunications Network
    161 -- 172James P. Kelly, Jiefeng Xu. A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem
    173 -- 187Jeff T. Linderoth, Martin W. P. Savelsbergh. A Computational Study of Search Strategies for Mixed Integer Programming
    188 -- 197Larry J. Leblanc, Jerome Chifflet, Philippe Mahey. Packet Routing in Telecommunication Networks with Path and Flow Restrictions
    198 -- 204Charles Fleurent, Fred Glover. Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
    205 -- 210Gérard Cornuéjols, Milind Dawande. A Class of Hard Small 0-1 Programs
    211 -- 216Gerhard J. Woeginger. An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine

    Volume 11, Issue 1

    1 -- 14Laurent D. Michel, Pascal Van Hentenryck. Localizer: A Modeling Language for Local Search
    15 -- 34Kate A. Smith. Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
    35 -- 43Mark A. Fleischer, Sheldon H. Jacobson. Information Theory and the Finite-Time Behavior of the Simulated Annealing Algorithm: Experimental Results
    44 -- 52Manuel Laguna, Rafael Martí. GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
    53 -- 62Alain Hertz, Gilbert Laporte, Pierrette Nanchen Hugo. Improvement Procedures for the Undirected Rural Postman Problem
    63 -- 77Olivier Guieu, John W. Chinneck. Analyzing Infeasible Mixed-Integer and Integer Linear Programs
    78 -- 94Zhi-Long Chen, Warren B. Powell. Solving Parallel Machine Scheduling Problems by Column Generation
    95 -- 103Erling D. Andersen. On Exploiting Problem Structure in a Basis Identification Procedure for Linear Programming
    104 -- 116W. E. Wilhelm, Pradip Som. Analysis of Stochastic Assembly with GI-Distributed Assembly Time
    117 -- 123Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh. Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
    runs on