Content
November 2018, Volume 30, Issue 4
- 646-661 The Meet-in-the-Middle Principle for Cutting and Packing Problems
by Jean-François Côté & Manuel Iori - 662-676 Exact Algorithms for Distributionally β -Robust Machine Scheduling with Uncertain Processing Times
by Yuli Zhang & Zuo-Jun Max Shen & Shiji Song - 677-693 Surrogate-Based Promising Area Search for Lipschitz Continuous Simulation Optimization
by Qi Fan & Jiaqiao Hu - 694-709 A Joint Vehicle Routing and Speed Optimization Problem
by Ricardo Fukasawa & Qie He & Fernando Santos & Yongjia Song - 710-723 Mathematical Programming Algorithms for Spatial Cloaking
by Alberto Ceselli & Maria Luisa Damiani & Giovanni Righini & Diego Valorsi - 724-738 Methods for System Selection Based on Sequential Mean–Variance Analysis
by Demet Batur & Lina Wang & F. Fred Choobineh - 739-749 The Ramping Polytope and Cut Generation for the Unit Commitment Problem
by Ben Knueven & Jim Ostrowski & Jianhui Wang - 750-767 A Knowledge Gradient Policy for Sequencing Experiments to Identify the Structure of RNA Molecules Using a Sparse Additive Belief Model
by Yan Li & Kristofer G. Reyes & Jorge Vazquez-Anderson & Yingfei Wang & Lydia M. Contreras & Warren B. Powell - 768-782 A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching
by Daniel Kowalczyk & Roel Leus
January 2018, Volume 30, Issue 4
- 634-645 Computable Error Bounds of Laplace Inversion for Pricing Asian Options
by Yingda Song & Ning Cai & Steven Kou
August 2018, Volume 30, Issue 3
- 424-437 Quadratic Combinatorial Optimization Using Separable Underestimators
by Christoph Buchheim & Emiliano Traversi - 438-453 T -Closeness Slicing: A New Privacy-Preserving Approach for Transactional Data Publishing
by Mingzheng Wang & Zhengrui Jiang & Haifang Yang & Yu Zhang - 454-471 Portfolio Optimization with Nonparametric Value at Risk: A Block Coordinate Descent Method
by Xueting Cui & Xiaoling Sun & Shushang Zhu & Rujun Jiang & Duan Li - 472-491 Scenario Generation for Single-Period Portfolio Selection Problems with Tail Risk Measures: Coping with High Dimensions and Integer Variables
by Jamie Fairbrother & Amanda Turner & Stein W. Wallace - 492-506 An Extended Mixed-Integer Programming Formulation and Dynamic Cut Generation Approach for the Stochastic Lot-Sizing Problem
by Huseyin Tunc & Onur A. Kilic & S. Armagan Tarim & Roberto Rossi - 507-521 Spare Parts Inventory Management with Substitution-Dependent Reliability
by Amin Khademi & Burak Eksioglu - 522-538 Lateness Minimization in Pairwise Connectivity Restoration Problems
by Igor Averbakh & Jordi Pereira - 539-553 Risk Averse Shortest Paths: A Computational Study
by Renaud Chicoisne & Fernando Ordóñez & Daniel Espinoza - 554-569 The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches
by Claudio Gambella & Joe Naoum-Sawaya & Bissan Ghaddar - 570-587 Structure Detection in Mixed-Integer Programs
by Taghi Khaniyev & Samir Elhedhli & Fatih Safa Erenay - 588-607 Physician Staffing for Emergency Departments with Time-Varying Demand
by Ran Liu & Xiaolan Xie - 608-624 What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
by Iain Dunning & Swati Gupta & John Silberholz
May 2018, Volume 30, Issue 2
- 217-224 Computing Minimum k -Connected m -Fold Dominating Set in General Graphs
by Zhao Zhang & Jiao Zhou & Shaojie Tang & Xiaohui Huang & Ding-Zhu Du - 225-235 Breaking the O (ln n ) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set
by Jiao Zhou & Zhao Zhang & Shaojie Tang & Xiaohui Huang & Ding-Zhu Du - 236-258 Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines
by Tao Wu & Zhe Liang & Canrong Zhang - 259-277 Optimizing Chemoradiotherapy to Target Metastatic Disease and Tumor Growth
by Hamidreza Badri & Ehsan Salari & Yoichi Watanabe & Kevin Leder - 278-294 Some Monotonicity Results for Stochastic Kriging Metamodels in Sequential Settings
by Bing Wang & Jiaqiao Hu - 295-308 Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study
by Krešimir Mihić & Kevin Ryan & Alan Wood - 309-323 Solving Highly Detailed Gas Transport MINLPs: Block Separability and Penalty Alternating Direction Methods
by Björn Geißler & Antonio Morsi & Lars Schewe & Martin Schmidt - 324-338 Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming
by Nathan Adelgren & Pietro Belotti & Akshay Gupte - 339-360 Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
by A. Pessoa & R. Sadykov & E. Uchoa & F. Vanderbeck - 361-370 An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances
by Oliver Lum & Bruce Golden & Edward Wasil - 371-387 Optimal Design of the Seasonal Influenza Vaccine with Manufacturing Autonomy
by Osman Y. Özaltın & Oleg A. Prokopyev & Andrew J. Schaefer - 388-401 Partially Adaptive Stochastic Optimization for Electric Power Generation Expansion Planning
by Jikai Zou & Shabbir Ahmed & Xu Andy Sun - 402-420 A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems
by Markus Leitner & Ivana Ljubić & Martin Luipersbeck & Markus Sinnl
February 2018, Volume 30, Issue 1
- 1-10 Space Reduction for a Class of Multidimensional Markov Chains: A Summary and Some Applications
by Qi-Ming He & Attahiru Sule Alfa - 11-30 FiberSCIP—A Shared Memory Parallelization of SCIP
by Yuji Shinano & Stefan Heinz & Stefan Vigerske & Michael Winkler - 31-42 Computing the Maximum Volume Inscribed Ellipsoid of a Polytopic Projection
by Jianzhe Zhen & Dick den Hertog - 43-56 Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem
by Betül Ahat & T?naz Ekim & Z. Caner Taşkın - 57-70 Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse
by Wim van Ackooij & Welington de Oliveira & Yongjia Song - 71-89 A Rare-Event Simulation Algorithm for Periodic Single-Server Queues
by Ni Ma & Ward Whitt - 90-105 Parallel Scenario Decomposition of Risk-Averse 0-1 Stochastic Programs
by Yan Deng & Shabbir Ahmed & Siqian Shen - 106-123 Benchmarking a Scalable Approximate Dynamic Programming Algorithm for Stochastic Control of Grid-Level Energy Storage
by Daniel F. Salas & Warren B. Powell - 124-136 Integrated Supply Chain Management via Randomized Rounding
by Lehilton L. C. Pedrosa & Maxim Sviridenko - 137-153 Incremental Upper Bound for the Maximum Clique Problem
by Chu-Min Li & Zhiwen Fang & Hua Jiang & Ke Xu - 154-167 Gradient-Based Adaptive Stochastic Search for Simulation Optimization Over Continuous Space
by Enlu Zhou & Shalabh Bhatnagar - 168-180 A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization
by Roberto Cordone & Pierre Hosteins & Giovanni Righini - 181-199 A Data-Driven Model of an Appointment-Generated Arrival Process at an Outpatient Clinic
by Song-Hee Kim & Ward Whitt & Won Chul Cha - 200-215 Optimal Sampling for Simulated Annealing Under Noise
by Robin C. Ball & Juergen Branke & Stephan Meisel
November 2017, Volume 29, Issue 4
- 581-596 SOCEMO: Surrogate Optimization of Computationally Expensive Multiobjective Problems
by Juliane Müller - 597-611 Exact Approaches for Designing Multifacility Buy-at-Bulk Networks
by Ashwin Arulselvan & Mohsen Rezapour - 612-630 A Distributed Interior-Point KKT Solver for Multistage Stochastic Optimization
by Jens Hübner & Martin Schmidt & Marc C. Steinbach - 631-644 Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers
by Bjorn P. Berg & Brian T. Denton - 645-659 Algorithm for the N -2 Security-Constrained Unit Commitment Problem with Transmission Switching
by Kathryn M. Schumacher & Amy E. M. Cohn & Richard Li-Yang Chen - 660-675 Content and Structure Coverage: Extracting a Diverse Information Subset
by Baojun Ma & Qiang Wei & Guoqing Chen & Jin Zhang & Xunhua Guo - 676-687 A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
by Alexandre Domingues Gonçalves & Artur Alves Pessoa & Cristiana Bentes & Ricardo Farias & Lúcia Maria de A. Drummond - 688-704 Approximations for the Queue Length Distributions of Time-Varying Many-Server Queues
by Jamol Pender & Young Myoung Ko - 705-723 The Vehicle Routing Problem with Release and Due Dates
by Benjamin C. Shelbourne & Maria Battarra & Chris N. Potts - 724-736 Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints
by Akiyoshi Shioura & Natalia V. Shakhlevich & Vitaly A. Strusevich - 737-753 Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands
by Maria Albareda-Sambola & Elena Fernández & Francisco Saldanha-da-Gama - 754-766 Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models
by Yash Puranik & Nikolaos V. Sahinidis - 767-779 Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location
by Camilo Ortiz-Astorquiza & Ivan Contreras & Gilbert Laporte
August 2017, Volume 29, Issue 3
- 377-387 A Matheuristic for the Multivehicle Inventory Routing Problem
by Claudia Archetti & Natashia Boland & Grazia Speranza - 388-404 Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities
by Sanjay Dominik Jena & Jean-François Cordeau & Bernard Gendron - 405-421 Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches
by Ibrahim Muter & Tevfik Aytekin - 422-437 Spatiotemporally Optimal Fractionation in Radiotherapy
by Fatemeh Saberian & Archis Ghate & Minsun Kim - 438-456 Collaboration Process Pattern Approach to Improving Teamwork Performance: A Data Mining-Based Methodology
by Shaokun Fan & Xin Li & J. Leon Zhao & Shaokun Fan & Xin Li & J. Leon Zhao - 457-473 A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
by Andrea Bettinelli & Valentina Cacchiani & Enrico Malaguti - 474-488 A Branch Decomposition Algorithm for the p -Median Problem
by Caleb C. Fast & Illya V. Hicks - 489-502 New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows
by Diego Pecin & Claudio Contardo & Guy Desaulniers & Eduardo Uchoa - 503-522 Active Learning with Multiple Localized Regression Models
by Meghana Deodhar & Joydeep Ghosh & Maytal Saar-Tsechansky & Vineet Keshari - 523-543 Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem
by Tao Wu & Kerem Akartunal? & Raf Jans & Zhe Liang - 544-557 Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem
by Ricardo Fukasawa & Laurent Poirrier - 558-580 Collaborative Operating Room Planning and Scheduling
by Vahid Roshanaei & Curtiss Luong & Dionne M. Aleman & David R. Urbach
May 2017, Volume 29, Issue 2
- 197-210 Enumeration and Cartesian Product Decomposition of Alternate Optimal Fluxes in Cellular Metabolism
by Onur Şeref & J. Paul Brooks & Bernice Huang & Stephen S. Fong - 211-231 Assessing the Quality of Convex Approximations for Two-Stage Totally Unimodular Integer Recourse Models
by Ward Romeijnders & David P. Morton & Maarten H. van der Vlerk - 232-250 Integrated Production, Inventory and Delivery Problems: Complexity and Algorithms
by Feng Li & Zhi-Long Chen & Zhi-Long Chen - 251-267 An Analytical Throughput Approximation for Closed Fork/Join Networks
by Erkut Sönmez & Alan Scheller-Wolf & Nicola Secomandi - 268-286 How to Deal with Liars? Designing Intelligent Rule-Based Expert Systems to Increase Accuracy or Reduce Cost
by Yuanfeng Cai & Zhengrui Jiang & Vijay Mookerjee - 287-300 Multisourcing Supply Network Design: Two-Stage Chance-Constrained Model, Tractable Approximations, and Computational Results
by Yongzhen Li & Jia Shu & Miao Song & Jiawei Zhang & Huan Zheng - 301-317 Algorithms for Generalized Clusterwise Linear Regression
by Young Woong Park & Yan Jiang & Diego Klabjan & Loren Williams - 318-331 Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation
by Alain Billionnet & Sourour Elloumi & Amélie Lambert & Angelika Wiegele - 332-349 Parallel Nonstationary Direct Policy Search for Risk-Averse Stochastic Optimization
by Somayeh Moazeni & Warren B. Powell & Boris Defourny & Belgacem Bouzaiene-Ayari - 350-366 Globalized Robust Optimization for Nonlinear Uncertain Inequalities
by Aharon Ben-Tal & Ruud Brekelmans & Dick den Hertog & Jean-Philippe Vial - 367-376 Technical Note: The MAP t / Ph t /∞ Queueing System and Multiclass [ MAP t / Ph t /∞] K Queueing Network
by Ira Gerhardt & Barry L. Nelson & Michael R. Taaffe
February 2017, Volume 29, Issue 1
- 1-17 Sampling the Functional Kolmogorov Forward Equations for Nonstationary Queueing Networks
by Jamol Pender - 18-35 Dynamic Pricing for Network Revenue Management: A New Approach and Application in the Hotel Industry
by Dan Zhang & Larry Weatherford - 36-53 Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method
by Kuo-Ling Huang & Sanjay Mehrotra - 54-76 Pricing Problems Under the Nested Logit Model with a Quality Consistency Constraint
by James M. Davis & Huseyin Topaloglu & David P. Williamson - 77-91 Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
by Merve Bodur & Sanjeeb Dash & Oktay Günlük & James Luedtke - 92-107 Combating Prerelease Piracy: Modeling the Effects of Antipiracy Measures in P2P Networks
by Il-Horn Hann & JooHee Oh - 108-122 Linear Reformulation of Polynomial Discrete Programming for Fast Computation
by Han-Lin Li & Yao-Huei Huang & Shu-Cherng Fang - 123-139 A Backward Sampling Framework for Interdiction Problems with Fortification
by Leonardo Lozano & J. Cole Smith - 140-151 Efficient Computational Analysis of Stationary Probabilities for the Queueing System BMAP / G /1/ N With or Without Vacation(s)
by A. D. Banik & M. L. Chaudhry - 152-169 Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones
by Manish Bansal & Kiavash Kianfar - 170-184 Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems
by Daniel Porumbel & François Clautiaux - 185-195 A Machine Learning-Based Approximation of Strong Branching
by Alejandro Marcos Alvarez & Quentin Louveaux & Louis Wehenkel