Content
November 2017, Volume 29, Issue 4
- 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