External Links

    Journal: INFORMS Journal on Computing

    Volume 27, Issue 4

    597 -- 618Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh. A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method
    619 -- 635Xue Bai, Sudip Bhattacharjee, Fidan Boylu, Ram D. Gopal. Growth Projections and Assortment Planning of Commodity Products Across Multiple Stores: A Data Mining and Optimization Approach
    636 -- 645Zhou Xu, Brian Rodrigues. A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots
    646 -- 657Andrew Ahn, Martin B. Haugh. Linear Programming and the Control of Diffusion Processes
    658 -- 676Rafael Martinelli, Claudio Contardo. Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure
    677 -- 689Adolfo R. Escobedo, Erick Moreno-Centeno. Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations
    690 -- 703Gilles Pesant. Achieving Domain Consistency and Counting Solutions for Dispersion Constraints
    704 -- 717Jiangchuan Huang, Christoph M. Kirsch, Raja Sengupta. Cloud Computing in Space
    718 -- 734Daniel Gartner, Rainer Kolisch, Daniel B. Neill, Rema Padman. Machine Learning Approaches for Early DRG Classification and Resource Allocation
    735 -- 754Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh. A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
    755 -- 772Serhat Gul, Brian T. Denton, John W. Fowler. A Progressive Hedging Approach for Surgery Planning Under Uncertainty
    773 -- 787Jérémy Omer, Samuel Rosat, Vincent Raymond, François Soumis. Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis
    788 -- 803Thomas Bortfeld, Jagdish Ramakrishnan, John N. Tsitsiklis, Jan Unkelbach. Optimization of Radiation Therapy Fractionation Schedules in the Presence of Tumor Repopulation

    Volume 27, Issue 3

    431 -- 448Silvio Alexandre de Araujo, Bert De Reyck, Zeger Degraeve, Ioannis Fragkos, Raf Jans. Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
    449 -- 461Mihai Bilauca, Graeme Gange, Patrick Healy, Kim Marriott, Peter Moulder, Peter J. Stuckey. Automatic Minimal-Height Table Layout
    462 -- 477Debabrata Dey, Atanu Lahiri, Guoying Zhang. Optimal Policies for Security Patch Management
    478 -- 490Karl Bringmann, Benjamin Doerr, Adrian Neumann, Jakub Sliacan. Online Checkpointing with Improved Worst-Case Guarantees
    491 -- 506Ohad Perry, Ward Whitt. Achieving Rapid Recovery in an Overload Control for Large-Scale Service Systems
    507 -- 524Artur Alves Pessoa, Michael Poss. Robust Network Design with Uncertain Outsourcing Cost
    525 -- 543Daniel R. Jiang, Warren B. Powell. Optimal Hour-Ahead Bidding in the Real-Time Electricity Market with Battery Storage Using Approximate Dynamic Programming
    544 -- 560Willem van Jaarsveld, Alan Scheller-Wolf. Optimization of Industrial-Scale Assemble-to-Order Systems
    561 -- 578Raymond Y. K. Lau, J. Leon Zhao, Wenping Zhang, Yi Cai, Eric W. T. Ngai. Learning Context-Sensitive Domain Ontologies from Folksonomies: A Cognitively Motivated Method

    Volume 27, Issue 2

    193 -- 203Jin Wang, Michael R. Taaffe. Multivariate Mixtures of Normal Distributions: Properties, Random Vector Generation, Fitting, and as Models of Market Daily Changes
    204 -- 220Si Chen, Ivana Ljubic, S. Raghavan. The Generalized Regenerator Location Problem
    221 -- 237Zhang-Hua Fu, Jin-Kao Hao. Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints
    238 -- 248Miles Lubin, Iain Dunning. Computing in Operations Research Using Julia
    249 -- 267Chungmok Lee, Minh Pham, Myong Kee Jeong, Dohyun Kim, Dennis K. J. Lin, Wanpracha Art Chavaolitwongse. A Network Structural Approach to the Link Prediction Problem
    268 -- 284Diarmuid Grimes, Emmanuel Hebrard. Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
    285 -- 300Yanwu Yang, Daniel Zeng, Yinghui Yang, Jie Zhang. Optimal Budget Allocation Across Search Advertising Markets
    301 -- 316Siqian Shen, Murat Kurt, Jue Wang. Chance-Constrained Programming Models and Approximations for General Stochastic Bottleneck Spanning Tree Problems
    317 -- 334L. Jeff Hong, Jun Luo, Barry L. Nelson. Chance Constrained Selection of the Best
    335 -- 357W. Zachary Rayfield, Paat Rusmevichientong, Huseyin Topaloglu. Approximation Methods for Pricing Problems Under the Nested Logit Model with Price Bounds
    358 -- 377Panos Parpas, Berk Ustun, Mort Webster, Quang Kha Tran. Importance Sampling in Stochastic Programming: A Markov Chain Monte Carlo Approach
    378 -- 391Etienne de Klerk, Renata Sotirov, Uwe Truetsch. A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives
    392 -- 405Fabio Furini, Manuel Iori, Silvano Martello, Mutsunori Yagiura. Heuristic and Exact Algorithms for the Interval Min-Max Regret Knapsack Problem
    406 -- 415Radislav Vaisman, Ofer Strichman, Ilya B. Gertsbakh. Model Counting of Monotone Conjunctive Normal Form Formulas with Spectra
    416 -- 430Maciej Rysz, Alexander Vinel, Pavlo A. Krokhmal, Eduardo L. Pasiliao. A Scenario Decomposition Algorithm for Stochastic Programming Problems with a Class of Downside Risk Measures

    Volume 27, Issue 1

    1 -- 19Eduardo Álvarez-Miranda, Ivana Ljubic, S. Raghavan, Paolo Toth. The Recoverable Robust Two-Level Network Design Problem
    20 -- 34Haibing Lu, Jaideep Vaidya, Vijayalakshmi Atluri, Yingjiu Li. Statistical Database Auditing Without Query Denial Threat
    35 -- 47Chun-An Chou, Zhe Liang, Wanpracha Art Chaovalitwongse, Tanya Y. Berger-Wolf, Bhaskar DasGupta, Saad I. Sheikh, Mary V. Ashley, Isabel C. Caballero. Column-Generation Framework of Nonlinear Similarity Model for Reconstructing Sibling Groups
    48 -- 58Masoud Yaghini, Mohammad Karimi, Mohadeseh Rahbar, Mohammad Hassan Sharifitabar. A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem
    59 -- 74Francisco Trespalacios, Ignacio E. Grossmann. Algorithmic Approach for Improved Mixed-Integer Reformulations of Convex Generalized Disjunctive Programs
    75 -- 88Edwin R. van Dam, Renata Sotirov. On Bounding the Bandwidth of Graphs with Symmetry
    89 -- 102Giovanni Pantuso, Kjetil Fagerholt, Stein W. Wallace. Solving Hierarchical Stochastic Programs: Application to the Maritime Fleet Renewal Problem
    103 -- 117Andrei Sleptchenko, M. Eric Johnson. Maintaining Secure and Reliable Distributed Control Systems
    118 -- 134Markus Leitner, Ivana Ljubic, Markus Sinnl. A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem
    135 -- 150Halil Sen, Kerem Bülbül. A Strong Preemptive Relaxation for Weighted Tardiness and Earliness/Tardiness Problems on Unrelated Parallel Machines
    151 -- 163Wolfgang Steitz. New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem
    164 -- 177Anurag Verma, Austin Buchanan, Sergiy Butenko. Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
    178 -- 188Austin Buchanan, Je Sang Sung, Sergiy Butenko, Eduardo L. Pasiliao. An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets
    189 -- 192Matthew J. Saltzman. Book Reviews
    runs on