Journal: INFORMS Journal on Computing

Volume 26, Issue 4

645 -- 657Bernard Gendron, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti. Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
658 -- 676Michelle L. Blom, Christina N. Burt, Adrian R. Pearce, Peter J. Stuckey. A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines
677 -- 689Yongxi Cheng, Ding-Zhu Du, Yinfeng Xu. A Zig-Zag Approach for Competitive Group Testing
690 -- 703Xiaojin Zheng, Xiaoling Sun, Duan Li. Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach
704 -- 717David R. Morrison, Jason J. Sauppe, Edward C. Sewell, Sheldon H. Jacobson. A Wide Branching Strategy for the Graph Coloring Problem
718 -- 734Carleton Coffrin, Pascal Van Hentenryck. A Linear-Programming Approximation of AC Power Flows
735 -- 747Yongjia Song, James R. Luedtke, Simge Küçükyavuz. Chance-Constrained Binary Packing Problems
748 -- 766Forbes J. Burkowski, Yuen-Lam Cheung, Henry Wolkowicz. Efficient Use of Semidefinite Programming for Selection of Rotamers in Protein Conformations
767 -- 779Esra Koca, Hande Yaman, M. Selim Aktürk. Lot Sizing with Piecewise Concave Production Costs
780 -- 797Sanjeeb Dash, Oktay Günlük, Juan Pablo Vielma. Computational Experiments with Cross and Crooked Cross Cuts
798 -- 808Yifei Zhao, Stein W. Wallace. Integrated Facility Layout Design and Flow Assignment Problem Under Uncertainty
809 -- 824Alexander Butsch, Jörg Kalcsics, Gilbert Laporte. Districting for Arc Routing
825 -- 847Dimitri J. Papageorgiou, Ahmet B. Keha, George L. Nemhauser, Joel S. Sokol. Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing
848 -- 865L. Jeff Hong, Sandeep Juneja, Jun Luo. Estimating Sensitivities of Portfolio Credit Risk Using Monte Carlo
866 -- 884Hao Xia, Milind Dawande, Vijay S. Mookerjee. Role Refinement in Access Control: Model and Analysis
885 -- 892Brent Fisher, Mohan L. Chaudhry. Computing the Distribution for the Number of Renewals with Bulk Arrivals
893 -- 909Grit Claßen, Arie M. C. A. Koster, David Coudert, Napoleão Nepomuceno. Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks

Volume 26, Issue 3

415 -- 432Behnam Behdani, J. Cole Smith. An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
433 -- 448Abhijeet Ghoshal, Sumit Sarkar. Association Rules for Recommendations with Multiple Items
449 -- 460Pierre L'Ecuyer, Richard J. Simard. On the Lattice Structure of a Special Class of Multiple Recursive Random Number Generators
461 -- 483Kaiquan Xu, Stephen Shaoyi Liao, Raymond Y. K. Lau, J. Leon Zhao. Effective Active Learning Strategies for the Use of Large-Margin Classifiers in Semantic Annotation: An Optimal Parameter Discovery Perspective
484 -- 499Michael C. Fu, Huashuai Qu. Regression Models Augmented with Direct Stochastic Gradient Estimators
500 -- 513Huseyin Onur Mete, Zelda B. Zabinsky. Multiobjective Interacting Particle Algorithm for Global Optimization
514 -- 530Ahmed Ghoniem, Hanif D. Sherali, Hojong Baik. Enhanced Models for a Mixed Arrival-Departure Aircraft Sequencing Problem
531 -- 546Feng Qiu, Shabbir Ahmed, Santanu S. Dey, Laurence A. Wolsey. Covering Linear Programming with Violations
547 -- 566Jason J. Sauppe, Sheldon H. Jacobson, Edward C. Sewell. Complexity and Approximation Results for the Balance Optimization Subset Selection Model for Causal Inference in Observational Studies
567 -- 585J. Paul Brooks, Eva K. Lee. Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model
586 -- 598Fang Fang, Kaushik Dutta, Anindya Datta. Domain Adaptation for Sentiment Classification in Light of Multiple Sources
599 -- 615Anahita Khojandi, Lisa M. Maillart, Oleg A. Prokopyev, Mark S. Roberts, Timothy Brown, William W. Barrington. Optimal Implantable Cardioverter Defibrillator (ICD) Generator Replacement
616 -- 628Eunji Lim. On Convergence Rates of Convex Regression in Multiple Dimensions
629 -- 643Supreet Reddy Mandala, Soundar R. T. Kumara, Kalyan Chatterjee. A Game-Theoretic Approach to Graph Clustering

Volume 26, Issue 2

199 -- 207Guilherme Kunigami, Pedro J. de Rezende, Cid C. de Souza, Tallys H. Yunes. Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation
208 -- 221Hongyan Liu, Yinghui (Catherine) Yang, Zhuohua Chen, Yong Zheng. A Tree-Based Contrast Set-Mining Approach to Detecting Group Differences
222 -- 237Santanu S. Dey, Andrea Lodi, Andrea Tramontani, Laurence A. Wolsey. On the Practical Strength of Two-Row Tableau Cuts
238 -- 252Hung-Pin Kao, Kwei Tang. Cost-Sensitive Decision Tree Induction with Label-Dependent Late Constraints
253 -- 268David Bergman, André A. Ciré, Willem Jan van Hoeve, John N. Hooker. Optimization Bounds from Binary Decision Diagrams
269 -- 279Athanassios N. Avramidis. Constructing Discrete Unbounded Distributions with Gaussian-Copula Dependence and Given Rank Correlation
280 -- 289John Gunnar Carlsson, Fan Jia, Ying Li. An Approximation Algorithm for the Continuous k-Medians Problem in a Convex Polygon
290 -- 302Chase Rainwater, Joseph Geunes, H. Edwin Romeijn. Resource-Constrained Assignment Problems with Shared Resource Consumption and Flexible Demand
303 -- 320Volkan Yazici, Cevdet Aykanat. Constrained Min-Cut Replication for K-Way Hypergraph Partitioning
321 -- 335Mohammad Javad Feizollahi, Igor Averbakh. The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
336 -- 350Amitabh Basu, Jesús A. De Loera, Mark Junod. On Chubanov's Method for Linear Programming
351 -- 369Gediminas Adomavicius, YoungOk Kwon. Optimization-Based Approaches for Maximizing Aggregate Recommendation Diversity
370 -- 384Vural Aksakalli, Ibrahim Ari. Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem
385 -- 400L. Jeff Hong, Zhaolin Hu, Liwei Zhang. Conditional Value-at-Risk Approximation to Value-at-Risk Constrained Programs: A Remedy via Monte Carlo
401 -- 413Kalyan T. Talluri. New Formulations for Choice Network Revenue Management

Volume 26, Issue 1

1 -- 15Oya Ekin Karasan, Ali Ridha Mahjoub, Onur Özkök, Hande Yaman. Survivability in Hierarchical Telecommunications Networks Under Dual Homing
16 -- 30Renata Sotirov. An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem
31 -- 44Hassan Hijazi, Pierre Bonami, Adam Ouorou. An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
45 -- 58Yan T. Yang, Barak Fishbain, Dorit S. Hochbaum, Eric B. Norman, Erik Swanberg. The Supervised Normalized Cut Method for Detecting, Classifying, and Identifying Special Nuclear Materials
59 -- 73Yunan Liu, Ward Whitt. Algorithms for Time-Varying Networks of Many-Server Fluid Queues
74 -- 87Russell R. Barton, Barry L. Nelson, Wei Xie. Quantifying Input Uncertainty via Simulation Confidence Intervals
88 -- 102Claudio Contardo, Jean-François Cordeau, Bernard Gendron. An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
103 -- 120Yossiri Adulyasak, Jean-François Cordeau, Raf Jans. Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
121 -- 134Chaoxu Tong, Huseyin Topaloglu. On the Approximate Linear Programming Approach for Network Revenue Management Problems
135 -- 149Jia Shu, Miao Song. Dynamic Container Deployment: Two-Stage Robust Model, Complexity, and Computational Results
150 -- 159Woonghee Tim Huh, Paat Rusmevichientong. Online Sequential Optimization with Biased Gradients: Theory and Applications to Censored Demand
160 -- 172Onur Seref, Ya-Ju Fan, Wanpracha Art Chaovalitwongse. Mathematical Programming Formulations and Algorithms for Discrete k-Median Clustering of Time-Series Data
173 -- 182Franklin Djeumou Fomeni, Adam N. Letchford. A Dynamic Programming Heuristic for the Quadratic Knapsack Problem
183 -- 198Matthew J. Robbins, Sheldon H. Jacobson, Uday V. Shanbhag, Banafsheh Behzad. The Weighted Set Covering Game: A Vaccine Pricing Model for Pediatric Immunization