Journal: INFORMS Journal on Computing

Volume 32, Issue 1

1 -- 2Alice E. Smith. Note from the Editor
3 -- 15Gerdus Benadè, John N. Hooker. Optimization Bounds from the Branching Dual
16 -- 39Tyler A. Perini, Natashia Boland, Diego Pecin, Martin W. P. Savelsbergh. A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method
40 -- 56Wei Xia, Juan-Carlos Vera 0001, Luis F. Zuluaga. Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
57 -- 73Daniel Jornada, V. Jorge Leon. Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint
74 -- 89Qinghua Wu, Yang Wang 0030, Fred W. Glover. Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
90 -- 100Daniel Oliveira, Artur Alves Pessoa. An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems
101 -- 119Maxence Delorme, Manuel Iori. Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
120 -- 134Okan Arslan, Ola Jabali, Gilbert Laporte. A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
135 -- 144Pierre L'Ecuyer, Paul Wambergue, Erwan Bourceret. Spectral Analysis of the MIXMAX Random Number Generators
145 -- 163Ilke Bakir, Natashia Boland, Brian Dandurand, Alan L. Erera. Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs
164 -- 171Jietao Xie, Juan Wu. Recursive Calculation Model for a Special Multivariate Normal Probability of First-Order Stationary Sequence
172 -- 181Yves Mocquard, Bruno Sericola, Emmanuelle Anceaume. Probabilistic Analysis of Rumor-Spreading Time
182 -- 198Daehan Won, Hasan Manzour, Wanpracha Art Chaovalitwongse. Convex Optimization for Group Feature Selection in Networked Data