Printed from https://ideas.repec.org/s/inm/orijoc3.html
Content
July 2021, Volume 33, Issue 3
- 839-860 3-D Dynamic UAV Base Station Location Problem
by Cihan Tugrul Cicek & Zuo-Jun Max Shen & Hakan Gultekin & Bulent Tavli - 861-881 Robust Models for the Kidney Exchange Problem
by Margarida Carvalho & Xenia Klimentova & Kristiaan Glorie & Ana Viana & Miguel Constantino - 882-897 Tagging Items Automatically Based on Both Content Information and Browsing Behaviors
by Shen Liu & Hongyan Liu - 898-914 Multicomponent Maintenance Optimization: A Stochastic Programming Approach
by Zhicheng Zhu & Yisha Xiang & Bo Zeng - 915-930 Rapid Discrete Optimization via Simulation with Gaussian Markov Random Fields
by Mark Semelhago & Barry L. Nelson & Eunhye Song & Andreas Wächter - 931-948 The Risk-Averse Static Stochastic Knapsack Problem
by Yasemin Merzifonluoglu & Joseph Geunes - 949-962 The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints
by Philippe Olivier & Andrea Lodi & Gilles Pesant - 963-978 Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
by Jean-François Côté & Mohamed Haouari & Manuel Iori - 979-996 The Rank-One Quadratic Assignment Problem
by Yang Wang & Wei Yang & Abraham P. Punnen & Jingbo Tian & Aihua Yin & Zhipeng Lü - 997-1014 Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting
by Edward He & Natashia Boland & George Nemhauser & Martin Savelsbergh - 1015-1036 A Framework for Solving Chance-Constrained Linear Matrix Inequality Programs
by Roya Karimi & Jianqiang Cheng & Miguel A. Lejeune - 1037-1055 Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty
by Chao Li & Muhong Zhang & Kory Hedman - 1056-1069 An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems
by Xiaodi Bai & Jie Sun & Xiaojin Zheng - 1070-1090 A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques
by Timo Gschwind & Stefan Irnich & Fabio Furini & Roberto Wolfler Calvo - 1091-1102 An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints
by Wenda Zhang & Jason J. Sauppe & Sheldon H. Jacobson - 1103-1119 Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded
by Miten Mistry & Dimitrios Letsios & Gerhard Krennrich & Robert M. Lee & Ruth Misener - 1120-1137 Data-Driven Optimization of Reward-Risk Ratio Measures
by Ran Ji & Miguel A. Lejeune - 1138-1161 Linearized Robust Counterparts of Two-Stage Robust Optimization Problems with Applications in Operations Management
by Amir Ardestani-Jaafari & Erick Delage - 1162-1176 A Branch-and-Bound Algorithm for Team Formation on Social Networks
by Nihal Berktaş & Hande Yaman - 1177-1196 Knowledge Learning of Insurance Risks Using Dependence Models
by Zifeng Zhao & Peng Shi & Xiaoping Feng - 1197-1212 A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints
by Zeyang Wu & Kameng Nip & Qie He - 1213-1228 An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives
by Jungho Park & Hadi El-Amine & Nevin Mutlu - 1229-1244 Multiproduct Newsvendor Problem with Customer-Driven Demand Substitution: A Stochastic Integer Program Perspective
by Jie Zhang & Weijun Xie & Subhash C. Sarin - 1245-1257 Modeling and Solving the Intersection Inspection Rural Postman Problem
by Debdatta Sinha Roy & Adriano Masone & Bruce Golden & Edward Wasil
May 2021, Volume 33, Issue 2
- 419-420 Note from the Editor
by Alice E. Smith - 421-435 Conflict Analysis for MINLP
by Timo Berthold & Jakob Witzig - 436-451 Modeling Single-Picker Routing Problems in Classical and Modern Warehouses
by Dominik Goeke & Michael Schneider - 452-476 A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants
by Zhixing Luo & Hu Qin & T. C. E. Cheng & Qinghua Wu & Andrew Lim - 477-494 Vehicle Sequencing at Transshipment Terminals with Handover Relations
by Dirk Briskorn & Malte Fliedner & Martin Tschöke - 495-510 Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem
by Kevin Dalmeijer & Guy Desaulniers - 511-530 Sparse Solutions by a Quadratically Constrained ℓ q (0 < q < 1) Minimization Model
by Shan Jiang & Shu-Cherng Fang & Qingwei Jin - 531-550 On the Solution of ℓ 0 -Constrained Sparse Inverse Covariance Estimation Problems
by Dzung T. Phan & Matt Menickelly - 551-565 A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
by Andrés Gómez & Oleg A. Prokopyev - 566-585 Supervised t -Distributed Stochastic Neighbor Embedding for Data Visualization and Classification
by Yichen Cheng & Xinlei Wang & Yusen Xia - 586-606 Data-Driven Preference Learning Methods for Value-Driven Multiple Criteria Sorting with Interacting Criteria
by Jiapeng Liu & Miłosz Kadziński & Xiuwu Liao & Xiaoxin Mao - 607-628 Semidefinite Programming and Nash Equilibria in Bimatrix Games
by Amir Ali Ahmadi & Jeffrey Zhang - 629-642 A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location
by A. D. López-Sánchez & J. Sánchez-Oro & M. Laguna - 643-656 A Learning-Based Matheuristic for Stochastic Multicommodity Network Design
by Fatemeh Sarayloo & Teodor Gabriel Crainic & Walter Rei - 657-671 Selecting the Best Alternative Based on Its Quantile
by Demet Batur & F. Fred Choobineh - 672-684 Reducing Simulation Input-Model Risk via Input Model Averaging
by Barry L. Nelson & Alan T. K. Wan & Guohua Zou & Xinyu Zhang & Xi Jiang - 685-705 Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem
by Filipe Rodrigues & Agostinho Agra & Cristina Requejo & Erick Delage - 706-720 Conflict-Driven Heuristics for Mixed Integer Programming
by Jakob Witzig & Ambros Gleixner - 721-738 Exact Multiple Sequence Alignment by Synchronized Decision Diagrams
by Amin Hosseininasab & Willem-Jan van Hoeve - 739-756 Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
by Álinson S. Xavier & Feng Qiu & Shabbir Ahmed - 757-773 Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs
by Yan Deng & Huiwen Jia & Shabbir Ahmed & Jon Lee & Siqian Shen - 774-784 Breaking the r max Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem
by Yingli Ran & Zhao Zhang & Shaojie Tang & Ding-Zhu Du - 785-807 Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem
by Alexander S. Estes & Michael O. Ball - 808-834 A Multistage Stochastic Programming Approach to the Optimal Surveillance and Control of the Emerald Ash Borer in Cities
by Eyyüb Y. Kıbış & İ. Esra Büyüktahtakın & Robert G. Haight & Najmaddin Akhundov & Kathleen Knight & Charles E. Flower - 835-835 Corrigendum to “A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems,” INFORMS Journal on Computing 28(1):14–30, 2016
by Natashia Boland & Riley Clement & Hamish Waterer
January 2021, Volume 33, Issue 1
- 1-1 Note from the Editor
by Alice E. Smith - 2-26 Approximate Dynamic Programming for Military Medical Evacuation Dispatching Policies
by Phillip R. Jenkins & Matthew J. Robbins & Brian J. Lunday - 27-33 SDDP.jl : A Julia Package for Stochastic Dual Dynamic Programming
by Oscar Dowson & Lea Kapelevich - 34-50 High-Performance Prototyping of Decomposition Methods in GAMS
by Timo Lohmann & Michael R. Bussieck & Lutz Westermann & Steffen Rebennack - 51-71 Stochastic Decomposition for Two-Stage Stochastic Linear Programs with Random Cost Coefficients
by Harsha Gangammanavar & Yifan Liu & Suvrajeet Sen - 72-85 Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
by Satya Tamby & Daniel Vanderpooten - 86-104 A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions
by Wenjun Ni & Jia Shu & Miao Song & Dachuan Xu & Kaike Zhang - 105-119 Polyhedral Results and Branch-and-Cut for the Resource Loading Problem
by Guopeng Song & Tamás Kis & Roel Leus - 120-142 Optimization for L 1 -Norm Error Fitting via Data Aggregation
by Young Woong Park - 143-162 Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios
by Hossein Hashemi Doulabi & Patrick Jaillet & Gilles Pesant & Louis-Martin Rousseau - 163-179 Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs
by Xiaojin Zheng & Yutong Pan & Zhaolin Hu - 180-197 Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties
by Hezhi Luo & Xiaodong Ding & Jiming Peng & Rujun Jiang & Duan Li - 198-215 Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
by Thomas Kleinert & Martin Schmidt - 216-229 A Computational Approach to First Passage Problems of Reflected Hyperexponential Jump Diffusion Processes
by Ning Cai & Xuewei Yang - 230-245 Efficient Sampling Allocation Procedures for Optimal Quantile Selection
by Yijie Peng & Chun-Hung Chen & Michael C. Fu & Jian-Qiang Hu & Ilya O. Ryzhov - 246-261 Calibration of Voting-Based Helpfulness Measurement for Online Reviews: An Iterative Bayesian Probability Approach
by Xunhua Guo & Guoqing Chen & Cong Wang & Qiang Wei & Zunqiang Zhang - 262-279 Sparse Convex Regression
by Dimitris Bertsimas & Nishanth Mundru - 280-299 A Review Selection Method for Finding an Informative Subset from Online Reviews
by Jin Zhang & Cong Wang & Guoqing Chen - 300-318 Integrating Individual and Aggregate Diversity in Top- N Recommendation
by Ethem Çanakoğlu & İbrahim Muter & Tevfik Aytekin - 319-335 The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm
by Zu-Jun Ma & Fei Yang & Ying Dai & Zuo-Jun Max Shen - 336-351 Robust Optimization for Electricity Generation
by Haoxiang Yang & David P. Morton & Chaithanya Bandi & Krishnamurthy Dvijotham - 352-369 Multistage Stochastic Power Generation Scheduling Co-Optimizing Energy and Ancillary Services
by Jianqiu Huang & Kai Pan & Yongpei Guan - 370-389 Worst-Case Expected Shortfall with Univariate and Bivariate Marginals
by Anulekha Dhara & Bikramjit Das & Karthik Natarajan - 390-400 Piecewise Constant Decision Rules via Branch-and-Bound Based Scenario Detection for Integer Adjustable Robust Optimization
by Ward Romeijnders & Krzysztof Postek - 401-418 Decision Diagram Decomposition for Quadratically Constrained Binary Optimization
by David Bergman & Leonardo Lozano
October 2020, Volume 32, Issue 4
- 855-856 Note from the Editor
by Alice E. Smith - 857-876 On Mixed-Integer Programming Formulations for the Unit Commitment Problem
by Bernard Knueven & James Ostrowski & Jean-Paul Watson - 877-894 An Approximation Approach for Response-Adaptive Clinical Trial Design
by Vishal Ahuja & John R. Birge - 895-911 Optimal Group Testing: Structural Properties and Robust Solutions, with Application to Public Health Screening
by Hrayer Aprahamian & Douglas R. Bish & Ebru K. Bish - 912-929 Evaluating a Prediction-Driven Targeting Strategy for Reducing the Transmission of Multidrug-Resistant Organisms
by Sean L. Barnes & Miranda Myers & Clare Rock & Daniel J. Morgan & Lisa Pineles & Kerri A. Thom & Anthony D. Harris - 930-951 A Theoretical Framework for Learning Tumor Dose-Response Uncertainty in Individualized Spatiobiologically Integrated Radiotherapy
by Ali Ajdari & Fatemeh Saberian & Archis Ghate - 952-967 The Optimal Design of Low-Latency Virtual Backbones
by Hamidreza Validi & Austin Buchanan - 968-985 Communication-Constrained Expansion Planning for Resilient Distribution Systems
by Geunyeong Byeon & Pascal Van Hentenryck & Russell Bent & Harsha Nagarajan - 986-995 Sampling Conditionally on a Rare Event via Generalized Splitting
by Zdravko I. Botev & Pierre L’Ecuyer - 996-1011 Understanding and Predicting Users’ Rating Behavior: A Cognitive Perspective
by Qiudan Li & Daniel Dajun Zeng & David Jingjun Xu & Ruoran Liu & Riheng Yao - 1012-1029 Production and Transportation Integration for Commit-to-Delivery Mode with General Shipping Costs
by Feng Li & Zhou Xu & Zhi-Long Chen - 1030-1048 An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem
by Francesco Carrabs & Carmine Cerrone & Raffaele Cerulli & Bruce Golden - 1049-1060 Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches
by Maurizio Boccia & Antonio Sforza & Claudio Sterle - 1061-1079 A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem
by Renata Mansini & Roberto Zanotti - 1080-1100 Biobjective Simulation Optimization on Integer Lattices Using the Epsilon-Constraint Method in a Retrospective Approximation Framework
by Kyle Cooper & Susan R. Hunter & Kalyani Nagaraj - 1101-1108 PyMOSO: Software for Multiobjective Simulation Optimization with R-PERLE and R-MinRLE
by Kyle Cooper & Susan R. Hunter - 1109-1127 Reducing Conservatism in Robust Optimization
by Ernst Roos & Dick den Hertog - 1128-1142 A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem
by Bo Zeng - 1143-1156 Predictive Analytics with Strategically Missing Data
by Juheng Zhang & Xiaoping Liu & Xiao-Bai Li - 1157-1181 Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs
by Nir Halman
July 2020, Volume 32, Issue 3
- 531-546 On the Derivation of Continuous Piecewise Linear Approximating Functions
by Lingxun Kong & Christos T. Maravelias - 547-564 Branch and Price for Chance-Constrained Bin Packing
by Zheng Zhang & Brian T. Denton & Xiaolan Xie - 565-581 Domination Measure: A New Metric for Solving Multiobjective Optimization
by Joshua Q. Hale & Helin Zhu & Enlu Zhou - 582-599 A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
by Samuel Deleplanque & Martine Labbé & Diego Ponce & Justo Puerto - 600-619 MILP Models for Complex System Reliability Redundancy Allocation with Mixed Components
by Young Woong Park - 620-640 Distributionally Robust Design for Redundancy Allocation
by Shuming Wang & Yan-Fu Li & Tong Jia - 641-660 Optimization-based Mechanisms for the Course Allocation Problem
by Hoda Atef Yekta & Robert Day - 661-681 Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty
by Anirudh Subramanyam & Panagiotis P. Repoussis & Chrysanthos E. Gounaris - 682-696 Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching
by Ksenia Bestuzheva & Hassan Hijazi & Carleton Coffrin - 697-713 Transient-State Natural Gas Transmission in Gunbarrel Pipeline Networks
by Shixuan Zhang & Sheng Liu & Tianhu Deng & Zuo-Jun Max Shen - 714-729 Learning to Correlate Accounts Across Online Social Networks: An Embedding-Based Approach
by Fan Zhou & Kunpeng Zhang & Shuying Xie & Xucheng Luo - 730-746 Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms
by Vladyslav Sokol & Ante Ćustić & Abraham P. Punnen & Binay Bhattacharya - 747-762 A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem
by Seyedmohammadhossein Hosseinian & Dalila B. M. M. Fontes & Sergiy Butenko - 763-778 An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph
by Zhuqi Miao & Balabhaskar Balasundaram - 779-789 Differentially Private Distributed Learning
by Yaqin Zhou & Shaojie Tang - 790-804 Differentially Private and Budget-Limited Bandit Learning over Matroids
by Kai Han & Yuntian He & Alex X. Liu & Shaojie Tang & He Huang - 805-821 Optimization-Driven Scenario Grouping
by Kevin Ryan & Shabbir Ahmed & Santanu S. Dey & Deepak Rajan & Amelia Musselman & Jean-Paul Watson - 822-834 When Lift-and-Project Cuts Are Different
by Egon Balas & Thiago Serra - 835-853 Assortment Optimization Under the Multinomial Logit Model with Sequential Offerings
by Nan Liu & Yuhang Ma & Huseyin Topaloglu
April 2020, Volume 32, Issue 2
- 199-200 Note from the Editor
by Alice E. Smith - 201-218 Robust Quadratic Programming with Mixed-Integer Uncertainty
by Areesh Mittal & Can Gokalp & Grani A. Hanasusanto - 219-233 On Solving the Quadratic Shortest Path Problem
by Hao Hu & Renata Sotirov - 234-248 Mitigating Information Asymmetry in Liver Allocation
by Sepehr Nemati & Zeynep G. Icten & Lisa M. Maillart & Andrew J. Schaefer - 249-262 The Mothership and Drone Routing Problem
by Stefan Poikonen & Bruce Golden - 263-278 An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
by Margarita P. Castro & Andre A. Cire & J. Christopher Beck - 279-288 Solving the Nearly Symmetric All-Pairs Shortest-Path Problem
by Gerald G. Brown & W. Matthew Carlyle - 289-302 Least-Cost Influence Maximization on Social Networks
by Dilek Günneç & S. Raghavan & Rui Zhanga - 303-320 Understanding the Impact of Individual Users’ Rating Characteristics on the Predictive Accuracy of Recommender Systems
by Xiaoye Cheng & Jingjing Zhang & Lu (Lucy) Yan - 321-345 Scalable, Adaptable, and Fast Estimation of Transient Downtime in Virtual Infrastructures Using Convex Decomposition and Sample Path Randomization
by Zhiling Guo & Jin Li & Ram Ramesh - 346-355 Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction
by Alper Atamtürk & Carlos Deck & Hyemin Jeon - 356-375 Online Risk Monitoring Using Offline Simulation
by Guangxin Jiang & L. Jeff Hong & Barry L. Nelson - 376-389 Estimating the Probability that a Function Observed with Noise Is Convex
by Nanjing Jian & Shane G. Henderson - 390-407 On the Variance of Single-Run Unbiased Stochastic Derivative Estimators
by Zhenyu Cui & Michael C. Fu & Jian-Qiang Hu & Yanchu Liu & Yijie Peng & Lingjiong Zhu - 408-427 Relative Robust and Adaptive Optimization
by Dimitris Bertsimas & Iain Dunning - 428-443 A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
by Lijun Wei & Zhixing Luo, & Roberto Baldacci & Andrew Lim - 444-460 Mathematical Models and Search Algorithms for the Capacitated p -Center Problem
by Raphael Kramer & Manuel Iori & Thibaut Vidal - 461-472 Multiobjective Integer Programming: Synergistic Parallel Approaches
by William Pettersson & Melih Ozlen - 473-506 Presolve Reductions in Mixed Integer Programming
by Tobias Achterberg & Robert E. Bixby & Zonghao Gu & Edward Rothberg & Dieter Weninger - 507-530 Piecewise Linear Function Fitting via Mixed-Integer Linear Programming
by Steffen Rebennack & Vitaliy Krasko
January 2020, Volume 32, Issue 1
- 1-2 Note from the Editor
by Alice E. Smith - 3-15 Optimization Bounds from the Branching Dual
by Gerdus Benadè & John N. Hooker - 16-39 A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method
by Tyler Perini & Natashia Boland & Diego Pecin & Martin Savelsbergh - 40-56 Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
by Wei Xia & Juan C. Vera & Luis F. Zuluaga - 57-73 Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint
by Daniel Jornada & V. Jorge Leon - 74-89 Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
by Qinghua Wu & Yang Wang & Fred Glover - 90-100 An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems
by Daniel Oliveira & Artur Pessoa - 101-119 Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
by Maxence Delorme & Manuel Iori - 120-134 A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
by Okan Arslan & Ola Jabali & Gilbert Laporte - 135-144 Spectral Analysis of the MIXMAX Random Number Generators
by Pierre L’Ecuyer & Paul Wambergue & Erwan Bourceret - 145-163 Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs
by Ilke Bakir & Natashia Boland & Brian Dandurand & Alan Erera - 164-171 Recursive Calculation Model for a Special Multivariate Normal Probability of First-Order Stationary Sequence
by Jietao Xie & Juan Wu - 172-181 Probabilistic Analysis of Rumor-Spreading Time
by Yves Mocquard & Bruno Sericola & Emmanuelle Anceaume - 182-198 Convex Optimization for Group Feature Selection in Networked Data
by Daehan Won & Hasan Manzour & Wanpracha Chaovalitwongse
October 2019, Volume 31, Issue 4
- 633-635 In Memoriam: Shabbir Ahmed (1969–2019)
by J. Cole Smith - 636-653 Toward Computing the Margin of Victory in Single Transferable Vote Elections
by Michelle Blom & Peter J. Stuckey & Vanessa J. Teague - 654-670 Vehicle Routing with Space- and Time-Correlated Stochastic Travel Times: Evaluating the Objective Function
by Zhaoxia Guo & Stein W. Wallace & Michal Kaut - 671-688 Learning to Rank in Entity Relationship Graphs
by Louiqa Raschid & Hassan Sayyadi & Vagelis Hristidis - 689-702 Surrogate Optimization of Computationally Expensive Black-Box Problems with Hidden Constraints
by Juliane Müller & Marcus Day - 703-718 Identification of Essential Proteins Using Induced Stars in Protein–Protein Interaction Networks
by Chrysafis Vogiatzis & Mustafa Can Camur - 719-731 Group Maintenance: A Restless Bandits Approach
by Abderrahmane Abbou & Viliam Makis - 732-744 Planning for Overtime: The Value of Shift Extensions in Physician Scheduling
by Andreas Fügener & Jens O. Brunner - 745-770 An Efficient Morris Method-Based Framework for Simulation Factor Screening
by Wen Shi & Xi Chen & Jennifer Shang - 771-789 Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters
by Ketan Date & Rakesh Nagi - 790-804 Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets
by Sune Lauth Gadegaard & Lars Relund Nielsen & Matthias Ehrgott - 805-822 Branch-and-Bound for Bi-objective Integer Programming
by Sophie N. Parragh & Fabien Tricoire - 823-840 A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs
by Alvaro Sierra Altamiranda & Hadi Charkhgard
July 2019, Volume 31, Issue 3
- 411-412 Note from the Editor
by Alice E. Smith - 413-428 No-Wait Scheduling for Locks
by Ward Passchyn & Dirk Briskorn & Frits C. R. Spieksma - 429-444 Enriching Solutions to Combinatorial Problems via Solution Engineering
by Thierry Petit & Andrew C. Trapp - 445-458 Robust Maximum Likelihood Estimation
by Dimitris Bertsimas & Omid Nohadani - 459-476 Identifying Fixations in Gaze Data via Inner Density and Optimization
by Andrew C. Trapp & Wen Liu & Soussan Djamasbi - 477-492 An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
by David Bergman - 493-514 Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms
by Lixin Tang & Feng Li & Zhi-Long Chen - 515-526 Computing the Moments of Polling Models with Batch Poisson Arrivals by Transform Inversion
by Wu-Lin Chen - 527-543 Two-Dimensional Phase Unwrapping via Balanced Spanning Forests
by Ian Herszterg & Marcus Poggi & Thibaut Vidal - 544-558 Real-Time Radiation Treatment Planning with Optimality Guarantees via Cluster and Bound Methods
by Baris Ungun & Lei Xing & Stephen Boyd - 559-575 Chance-Constrained Surgery Planning Under Conditions of Limited and Ambiguous Data
by Yan Deng & Siqian Shen & Brian Denton - 576-592 Virtual Statistics in Simulation via k Nearest Neighbors
by Yujing Lin & Barry L. Nelson & Linda Pei - 593-611 A Dynamic Programming Approach to Power Consumption Minimization in Gunbarrel Natural Gas Networks with Nonidentical Compressor Units
by Tianhu Deng & Yong Liang & Shixuan Zhang & Jingze Ren & Shuyi Zheng - 612-632 Permutations in the Factorization of Simplex Bases
by Ricardo Fukasawa & Laurent Poirrier
April 2019, Volume 31, Issue 2
- 193-206 Transit Pattern Detection Using Tensor Factorization
by Bowen Du & Wenjun Zhou & Chuanren Liu & Yifeng Cui & Hui Xiong - 207-225 Performance Comparison of Machine Learning Platforms
by Asim Roy & Shiban Qureshi & Kartikeya Pande & Divitha Nair & Kartik Gairola & Pooja Jain & Suraj Singh & Kirti Sharma & Akshay Jagadale & Yi-Yang Lin & Shashank Sharma & Ramya Gotety & Yuexin Zhang & Ji Tang & Tejas Mehta & Hemanth Sindhanuru & Nonso Okafor & Santak Das & Chidambara N. Gopal & Srinivasa B. Rudraraju & Avinash V. Kakarlapudi - 226-234 Efficient Convexification Strategy for Generalized Geometric Programming Problems
by Hao-Chun Lu & Liming Yao - 235-250 Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations
by Jun Pei & Zorica Dražić & Milan Dražić & Nenad Mladenović & Panos M. Pardalos - 251-267 Primal Heuristics for Branch and Price: The Assets of Diving Methods
by Ruslan Sadykov & François Vanderbeck & Artur Pessoa & Issam Tahiri & Eduardo Uchoa - 268-284 New Valid Inequalities for the Optimal Communication Spanning Tree Problem
by Yogesh Kumar Agarwal & Prahalad Venkateshan - 285-301 Target Cuts from Relaxed Decision Diagrams
by Christian Tjandraatmadja & Willem-Jan van Hoeve - 302-317 Solving Large Batches of Linear Programs
by Ilbin Lee & Stewart Curry & Nicoleta Serban - 335-346 A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone
by Stefan Poikonen & Bruce Golden & Edward A. Wasil - 347-366 Modeling and Simulation of Nonstationary Non-Poisson Arrival Processes
by Ran Liu & Michael E. Kuhl & Yunan Liu & James R. Wilson - 367-389 Finding Critical Links for Closeness Centrality
by Alexander Veremyev & Oleg A. Prokopyev & Eduardo L. Pasiliao - 390-410 Interdiction Games and Monotonicity, with Application to Knapsack Problems
by Matteo Fischetti & Ivana Ljubić & Michele Monaci & Markus Sinnl
February 2019, Volume 31, Issue 1
- 1-1 Message from the Editor
by Alice E. Smith - 2-20 Data-Driven Decisions for Problems with an Unspecified Objective Function
by Zhen Sun & Milind Dawande & Ganesh Janakiraman & Vijay Mookerjee - 21-39 An Asymptotically Optimal Set Approach for Simulation Optimization
by Liujia Hu & Sigrún Andradóttir - 40-65 Dynamic Compressor Optimization in Natural Gas Pipeline Systems
by Terrence W. K. Mak & Pascal Van Hentenryck & Anatoly Zlotnik & Russell Bent - 66-82 A New Approach to Real-Time Bidding in Online Advertisements: Auto Pricing Strategy
by Shalinda Adikari & Kaushik Dutta - 83-99 An Approximation Algorithm for Capacity Allocation Over a Single Flight Leg with Fare-Locking
by Mika Sumida & Huseyin Topaloglu - 100-114 Robust Optimization of Dose-Volume Metrics for Prostate HDR-Brachytherapy Incorporating Target and OAR Volume Delineation Uncertainties
by Marleen Balvert & Dick den Hertog & Aswin L. Hoffmann - 115-133 A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming
by Aritra Pal & Hadi Charkhgard - 134-152 A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing
by Masoud Chitsaz & Jean-François Cordeau & Raf Jans - 153-170 Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions
by Xin Wang & Teodor Gabriel Crainic & Stein W. Wallace - 171-192 Exact Approaches for Network Design Problems with Relays
by Markus Leitner & Ivana Ljubić & Martin Riedler & Mario Ruthmair
November 2018, Volume 30, Issue 4
- 625-633 Disjunctive Programming for Multiobjective Discrete Optimisation
by Tolga Bektaş