INFORMS Journal on Computing, Volume 23

Volume 23, Number 1, Winter 2011

• J. Christopher Beck, T. K. Feng, Jean-Paul Watson:
  Combining Constraint Programming and Local Search for Job-Shop Scheduling. 1-14
  
• Slawomir Bak, Jacek Blazewicz, Grzegorz Pawlak, Maciej Plaza, Edmund K. Burke, Graham Kendall:
  A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem. 15-25
  
• Alberto Caprara, Adam N. Letchford, Juan José Salazar González:
  Decorous Lower Bounds for Minimum Linear Arrangement. 26-40
  
• Iván A. Contreras, Juan A. Díaz, Elena Fernández:
  Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment. 41-55
  
• S. Raghavan, Daliborka Stanojevic:
  Branch and Price for WDM Optical Networks with No Bifurcation of Flow. 56-74
  
• Aysegül Altin, Hande Yaman, Mustafa Ç. Pinar:
  The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations. 75-89
  
• Marco A. Boschetti, Vittorio Maniezzo, Matteo Roffilli:
  A Fully Distributed Lagrangean Solution for a Peer-to-Peer Overlay Network Design Problem. 90-104
  
• Faramroze G. Engineer, George L. Nemhauser, Martin W. P. Savelsbergh:
  Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem. 105-119
  
• Maria Garcia de la Banda, Peter J. Stuckey, Geoffrey Chu:
  Solving Talent Scheduling with Dynamic Programming. 120-137
  
• Zan Huang, Daniel Dajun Zeng:
  Why Does Collaborative Filtering Work? Transaction-Based Recommendation Model Validation and Selection by Analyzing Bipartite Random Graphs. 138-152
  
• Qi-Ming He, Hanqin Zhang, Jungong Xue:
  Algorithms for Coxianization of Phase-Type Generators. 153-164
  
• Benny Van Houdt, Johan van Leeuwaarden:
  Triangular M/G/1-Type and Tree-Like Quasi-Birth-Death Markov Chains. 165-171
  

Volume 23, Number 2, Spring 2011

• John W. Chinneck:
  From the Editor. 173
  
• Sam Ransbotham, Ishwar Murthy, Sabyasachi Mitra, Sridhar Narasimhan:
  Sequential Grid Computing: Models and Computational Experiments. 174-188
  
• Nicole Megow, Rolf H. Möhring, Jens Schulz:
  Decision Support and Optimization in Shutdown and Turnaround Scheduling. 189-204
  
• Ciamac Cyrus Moallemi, Benjamin Van Roy:
  Resource Allocation via Message Passing. 205-219
  
• Sakine Batun, Brian T. Denton, Todd R. Huschka, Andrew J. Schaefer:
  Operating Room Pooling and Parallel Surgery Processing Under Uncertainty. 220-237
  
• Wolfgang Jank, Shu Zhang:
  An Automated and Data-Driven Bidding Strategy for Online Auctions. 238-253
  
• José Niño-Mora:
  Computing a Classic Index for Finite-Horizon Bandits. 254-267
  
• Juan A. Carrasco:
  An Efficient and Numerically Stable Method for Computing Bounds for the Interval Availability Distribution. 268-283
  
• José H. Dulá:
  An Algorithm for Data Envelopment Analysis. 284-296
  
• Ali Tafazzoli, James R. Wilson, Emily K. Lada, Natalie M. Steiger:
  Performance of Skart: A Skewness- and Autoregression-Adjusted Batch Means Procedure for Simulation Analysis. 297-314
  
• Chris Groër, Bruce L. Golden, Edward A. Wasil:
  A Parallel Algorithm for the Vehicle Routing Problem. 315-330
  

Volume 23, Number 3, Summer 2011

• Michele Samorani, Manuel Laguna, Robert Kirk DeLisle, Daniel C. Weaver:
  A Randomized Exhaustive Propositionalization Approach for Molecule Classification. 331-345
  
• Diana M. Negoescu, Peter Frazier, Warren B. Powell:
  The Knowledge-Gradient Algorithm for Sequencing Experiments in Drug Discovery. 346-363
  
• Pierre Brice, Wei Jiang, Guohua Wan:
  A Cluster-Based Context-Tree Model for Multivariate Data Streams with Applications to Anomaly Detection. 364-376
  
• Piyush Kumar, E. Alper Yildirim:
  A Linearly Convergent Linear-Time First-Order Algorithm for Support Vector Classification with a Core Set Result. 377-391
  
• Osman Y. Özaltin, Brady Hunsaker, Andrew J. Schaefer:
  Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs. 392-403
  
• Samir Elhedhli, Lingzi Li, Mariem Gzara, Joe Naoum-Sawaya:
  A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts. 404-415
  
• Amar Kumar Narisetty, Jean-Philippe P. Richard, George L. Nemhauser:
  Lifted Tableaux Inequalities for 0-1 Mixed-Integer Programs: A Computational Study. 416-424
  
• Gary J. Koehler:
  Minimal Equivalent Binary Knapsack Inequalities. 425-429
  
• Abdullah Konak, Alice E. Smith:
  Efficient Optimization of Reliable Two-Node Connected Networks: A Biobjective Approach. 430-445
  
• Paola Cappanera, Maria Grazia Scutellà:
  Color-Coding Algorithms to the Balanced Path Problem: Computational Issues. 446-459
  
• Daniel Reich, Leo Lopes:
  Preprocessing Stochastic Shortest-Path Problems with Application to PERT Activity Networks. 460-469
  
• Zuo-Jun Max Shen, Roger Lezhou Zhan, Jiawei Zhang:
  The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms. 470-482
  
• Jung-Fa Tsai, Ming-Hua Lin:
  An Efficient Global Approach for Posynomial Geometric Programming Problems. 483-492
  

Volume 23, Number 4, Fall 2011

• Gijs Rennen, Edwin R. van Dam, Dick den Hertog:
  Enhancement of Sandwich Algorithms for Approximating Higher-Dimensional Convex Pareto Sets. 493-517
  
• Bogdan Pasaniuc, Robert S. Garfinkel, Ion I. Mandoiu, Alexander Zelikovsky:
  Optimal Testing of Digital Microfluidic Biochips. 518-529
  
• François Clautiaux, Cláudio Alves, José M. Valério de Carvalho, Jürgen Rietz:
  New Stabilization Procedures for the Cutting Stock Problem. 530-545
  
• Sergio García, Martine Labbé, Alfredo Marín:
  Solving Large p-Median Problems with a Radius Formulation. 546-556
  
• Ugur Kaplan, Metin Türkay, Bülent Karasözen, Lorenz T. Biegler:
  Optimization of Supply Chain Systems with Price Elasticity of Demand. 557-568
  
• Issmail Elhallaoui, Abdelmoutalib Metrane, Guy Desaulniers, François Soumis:
  An Improved Primal Simplex Algorithm for Degenerate Linear Programs. 569-577
  
• Amitabh Basu, Pierre Bonami, Gérard Cornuéjols, François Margot:
  Experiments with Two-Row Cuts from Degenerate Tableaux. 578-590
  
• Alex Y. D. Siem, Dick den Hertog, Aswin L. Hoffmann:
  A Method for Approximating Univariate Convex Functions Using Only Function Value Evaluations. 591-604
  
• Pia Domschke, Björn Geißler, Oliver Kolb, Jens Lang, Alexander Martin, Antonio Morsi:
  Combination of Nonlinear and Linear Optimization of Transient Gas Networks. 605-617
  
• Yuping Wang, Hong Li, Chuangyin Dang:
  A New Evolutionary Algorithm for a Class of Nonlinear Bilevel Programming Problems and Its Global Convergence. 618-629
  
• Ravi Bapna, Sanjukta Das, Robert Day, Robert S. Garfinkel, Jan Stallaert:
  A Clock-and-Offer Auction Market for Grid Resources When Bidders Face Stochastic Computational Needs. 630-647
  

Last update Sat May 25 16:16:13 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page