Journal: INFORMS Journal on Computing

Volume 24, Issue 4

517 -- 0John W. Chinneck. From the Editor
518 -- 533Ehsan Salari, H. Edwin Romeijn. Quantifying the Trade-off Between IMRT Treatment Plan Quality and Delivery Efficiency Using Direct Aperture Optimization
534 -- 553Bruce L. Golden, Zahra Naji Azimi, S. Raghavan, Majid Salari, Paolo Toth. The Generalized Covering Salesman Problem
554 -- 564Nicolas Jozefowiez, Gilbert Laporte, Frédéric Semet. A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem
565 -- 577John Gunnar Carlsson. Dividing a Territory Among Several Vehicles
578 -- 596Faramroze G. Engineer, George L. Nemhauser, Martin W. P. Savelsbergh, Jin-Hwa Song. The Fixed-Charge Shortest-Path Problem
597 -- 610Simon Görtz, Andreas Klose. A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem
611 -- 623Milind Dawande, Vijay S. Mookerjee, Chelliah Sriskandarajah, Yunxia Zhu. Structural Search and Optimization in Social Networks
624 -- 635Dashi I. Singham, Lee W. Schruben. Finite-Sample Performance of Absolute Precision Stopping Rules
636 -- 647Lih-Yuan Deng, Jyh-Jen Horng Shiau, Henry Horng-Shing Lu. 31 - 1
648 -- 664Xue Bai. A Mathematical Framework for Data Quality Management in Enterprise Systems
665 -- 682Warren B. Powell, Abraham P. George, Hugo P. Simão, Warren Scott, Alan Lamont, Jeffrey Stewart. SMART: A Stochastic Multiscale Model for the Analysis of Energy Resources, Technology, and Policy

Volume 24, Issue 3

343 -- 355Gerardo Berbeglia, Jean-François Cordeau, Gilbert Laporte. A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem
356 -- 371Roberto Baldacci, Aristide Mingozzi, Roberto Roberti. New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
372 -- 386Yinghui (Catherine) Yang, Balaji Padmanabhan, Hongyan Liu, Xiaoyu Wang. Discovery of Periodic Patterns in Sequence Data: A Variance-Based Approach
387 -- 398Mohammad M. Fazel-Zarandi, J. Christopher Beck. Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem
399 -- 415Renata Mansini, Maria Grazia Speranza. CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem
416 -- 432Xue Bai, Ram D. Gopal, Manuel A. Nunez, Dmitry Zhdanov. On the Prevention of Fraud and Privacy Exposure in Process Information Flow
433 -- 442Edward C. Sewell, Sheldon H. Jacobson. A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem
443 -- 456Xiangyong Li, Yash P. Aneja. A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks
457 -- 470Sam D. Allen, Edmund K. Burke. Data Structures for Higher-Dimensional Rectilinear Packing
471 -- 484Gabriella Dellino, Jack P. C. Kleijnen, Carlo Meloni. Robust Optimization in Simulation: Taguchi and Krige Combined
485 -- 499Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus, Frits C. R. Spieksma. Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles
500 -- 515Simon A. Spacey, Wolfram Wiesemann, Daniel Kuhn, Wayne Luk. Robust Software Partitioning with Multiple Instantiation

Volume 24, Issue 2

187 -- 201Daniel Delling, Giacomo Nannicini. Core Routing on Dynamic Time-Dependent Road Networks
202 -- 209Peter M. Hahn, Yi-Rong Zhu, Monique Guignard, William L. Hightower, Matthew J. Saltzman. A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem
210 -- 227Michele Samorani, Manuel Laguna. Data-Mining-Driven Neighborhood Search
228 -- 244Arnaud Malapert, Hadrien Cambazard, Christelle Guéret, Narendra Jussien, André Langevin, Louis-Martin Rousseau. An Optimal Constraint Programming Approach to the Open-Shop Problem
245 -- 259Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos, Panayiotis Miliotis. Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem
260 -- 275Mehmet C. Demirci, Andrew J. Schaefer, H. Edwin Romeijn, Mark S. Roberts. An Exact Method for Balancing Efficiency and Equity in the Liver Allocation Hierarchy
276 -- 294Daniele Catanzaro, Martine Labbé, Raffaele Pesenti, Juan José Salazar González. The Balanced Minimum Evolution Problem
295 -- 310Soumyadip Ghosh, Raghu Pasupathy. C-NORTA: A Rejection Procedure for Sampling from the Tail of Bivariate NORTA Distributions
311 -- 327Zan Huang, Akhil Kumar. A Study of Quality and Accuracy Trade-offs in Process Mining
328 -- 341Jonathan Eckstein, Noam Goldberg. An Improved Branch-and-Bound Method for Maximum Monomial Agreement

Volume 24, Issue 1

1 -- 9Jeff X. Yang, John H. Drew, Lawrence M. Leemis. Automating Bivariate Transformations
10 -- 28William Kaczynski, Lawrence M. Leemis, John H. Drew. Transient Queueing Analysis
29 -- 41Armann Ingolfsson, Ling Tang. Efficient and Reliable Computation of Birth-Death Process Performance Measures
42 -- 52Kaiqi Yu, Mei-Ling Huang, Percy H. Brill. An Algorithm for Fitting Heavy-Tailed Distributions via Generalized Hyperexponentials
53 -- 65Ebru Angün, Jack P. C. Kleijnen. An Asymptotic Test of Optimality Conditions in Multiresponse Simulation Optimization
66 -- 80Roberto Rossi, S. Armagan Tarim, Ramesh Bollapragada. Constraint-Based Local Search for Inventory Control Under Stochastic Demand and Lead Time
81 -- 100Stefano Gualandi, Federico Malucelli. Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation
101 -- 116Claudia Archetti, Luca Bertazzi, Alain Hertz, Maria Grazia Speranza. A Hybrid Heuristic for an Inventory Routing Problem
117 -- 131Jong-Seok Lee, Dan Zhu. Shilling Attack Detection - A New Approach for a Trustworthy Recommender System
132 -- 147Sanjeeb Dash, Oktay Günlük, Andrea Lodi, Andrea Tramontani. A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows
148 -- 164Daniel Adelman, Diego Klabjan. Computing Near-Optimal Policies in Generalized Joint Replenishment
165 -- 171Pasquale Avella, Maurizio Boccia, Igor Vasilyev. Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable
172 -- 186Brian Keller, Güzin Bayraksan. Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints