default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDINFORMS Journal on Computing, Volume 34
Volume 34, Number 1, January - February 2022
- Alice E. Smith
:
Note from the Editor. 1
- J. Paul Brooks, Ted K. Ralphs, Nicola Secomandi:
Special Issue of INFORMS Journal on Computing - Scalable Reinforcement Learning Algorithms. 2-3
- Janiele Custodio, Miguel A. Lejeune:
Spatiotemporal Data Set for Out-of-Hospital Cardiac Arrests. 4-10 - Dávid Papp, Sercan Yildiz:
Alfonso: Matlab Package for Nonsymmetric Conic Optimization. 11-19 - Gregor Selinka, Raik Stolletz, Thomas I. Maindl:
Performance Approximation for Time-Dependent Queues with Generally Distributed Abandonments. 20-38 - Diego Goldsztajn, Sem C. Borst, Johan S. H. van Leeuwaarden, Debankur Mukherjee, Philip A. Whiting:
Self-Learning Threshold-Based Load Balancing. 39-54 - Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier, Pavel V. Smirnov:
Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments. 55-75 - Yannick Kergosien, Antoine Giret, Emmanuel Néron, Gaël Sauvanet:
An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem. 76-92 - Mustafa Can Camur, Thomas C. Sharkey, Chrysafis Vogiatzis:
The Star Degree Centrality Problem: A Decomposition Approach. 93-112 - Ozgur M. Araz, Mayteé Cruz-Aponte, Fernando A. Wilson, Brock W. Hanisch, Ruth S. Margalit:
An Analytic Framework for Effective Public Health Program Design Using Correctional Facilities. 113-128 - Liping Zhou, Na Geng, Zhibin Jiang, Shan Jiang:
Integrated Multiresource Capacity Planning and Multitype Patient Scheduling. 129-149 - Hrayer Aprahamian, Hadi El-Amine:
Optimal Screening of Populations with Heterogeneous Risk Profiles Under the Availability of Multiple Tests. 150-164 - Qiong Zhang, Amin Khademi, Yongjia Song:
Min-Max Optimal Design of Two-Armed Trials with Side Information. 165-182 - Kanix Wang, Walid Hussain, John R. Birge, Michael D. Schreiber, Daniel Adelman:
A High-Fidelity Model to Predict Length of Stay in the Neonatal Intensive Care Unit. 183-195 - Jianzhe Zhen, Frans J. C. T. de Ruiter, Ernst Roos, Dick den Hertog:
Robust Optimization for Models with Uncertain Second-Order Cone and Semidefinite Programming Constraints. 196-210 - Ahmadreza Marandi, Aharon Ben-Tal, Dick den Hertog, Bertrand Melenberg:
Extending the Scope of Robust Quadratic Optimization. 211-226 - Eric Larsen, Sébastien Lachapelle, Yoshua Bengio, Emma Frejinger, Simon Lacoste-Julien, Andrea Lodi:
Predicting Tactical Solutions to Operational Planning Problems Under Imperfect Information. 227-242 - Frauke Liers, Lars Schewe, Johannes Thürauf:
Radius of Robust Feasibility for Mixed-Integer Problems. 243-261 - Qinxiao Yu, Yossiri Adulyasak, Louis-Martin Rousseau, Ning Zhu, Shoufeng Ma:
Team Orienteering with Time-Varying Profit. 262-280 - Ben Hermans, Roel Leus, Jannik Matuschke:
Exact and Approximation Algorithms for the Expanding Search Problem. 281-296 - Moira MacNeil, Merve Bodur:
Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems. 297-314 - Hassan Zohali, Bahman Naderi, Vahid Roshanaei:
Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition. 315-332 - Erick Delage, Ahmed Saif:
The Value of Randomized Solutions in Mixed-Integer Distributionally Robust Optimization Problems. 333-353 - Hossein Hashemi Doulabi, Shabbir Ahmed, George L. Nemhauser:
State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems. 354-369 - Ziye Tang, Yang Jiao, R. Ravi:
Combinatorial Heuristics for Inventory Routing Problems. 370-384 - Tao Wu:
Predictive Search for Capacitated Multi-Item Lot Sizing Problems. 385-406 - Yongzhen Li, Xueping Li, Jia Shu, Miao Song, Kaike Zhang:
A General Model and Efficient Algorithms for Reliable Facility Location Problem Under Uncertain Disruptions. 407-426 - Thiago Serra, Teng Huang, Arvind U. Raghunathan, David Bergman:
Template-Based Minor Embedding for Adiabatic Quantum Optimization. 427-439 - Maximilian Löffler, Nils Boysen, Michael Schneider:
Picker Routing in AGV-Assisted Order Picking Systems. 440-462 - Sidhant Misra, Line Roald, Yeesian Ng:
Learning for Constrained Optimization: Identifying Optimal Active Constraint Sets. 463-480 - Shutong Chen, Weijun Xie:
On Cluster-Aware Supervised Learning: Frameworks, Convergent Algorithms, and Applications. 481-502 - Gediminas Adomavicius, Yaqiong Wang:
Improving Reliability Estimation for Individual Numeric Predictions: A Machine Learning Approach. 503-521 - Yi Yang, Kunpeng Zhang, Yangyang Fan:
Analyzing Firm Reports for Volatility Prediction: A Knowledge-Driven Text-Embedding Approach. 522-540 - Zhu Zhang, Xuan Wei, Xiaolong Zheng, Qiudan Li, Daniel Dajun Zeng:
Detecting Product Adoption Intentions via Multiview Deep Learning. 541-556 - Zhongshun Shi, Yijie Peng, Leyuan Shi, Chun-Hung Chen, Michael C. Fu:
Dynamic Sampling Allocation Under Finite Simulation Budget for Feasibility Determination. 557-568 - Songhao Wang, Szu Hui Ng, William Benjamin Haskell:
A Multilevel Simulation Optimization Approach for Quantile Functions. 569-585 - Ying Zhong, Shaoxuan Liu, Jun Luo, L. Jeff Hong:
Speeding Up Paulson's Procedure for Large-Scale Problems Using Parallel Computing. 586-606 - Jack P. C. Kleijnen, Wim C. M. van Beers:
Statistical Tests for Cross-Validation of Kriging Models. 607-621 - Qun Meng, Songhao Wang, Szu Hui Ng:
Combined Global and Local Search for Optimization with Gaussian Process Models. 622-637 - Yijie Peng, Li Xiao, Bernd Heidergott, L. Jeff Hong, Henry Lam:
A New Likelihood Ratio Method for Training Artificial Neural Networks. 638-655 - Olga Kuryatnikova, Renata Sotirov, Juan C. Vera:
The Maximum k-Colorable Subgraph Problem and Related Problems. 656-669
Volume 34, Number 2, March - April 2022
- Alice E. Smith:
Note from the Editor. 671
- Benoît Legat, Oscar Dowson, Joaquim Dias Garcia, Miles Lubin:
MathOptInterface: A Data Structure for Mathematical Optimization Problems. 672-689 - Haoxiang Yang, Harsha Nagarajan:
Optimal Power Flow in Distribution Networks Under N - 1 Disruptions: A Multistage Stochastic Programming Approach. 690-709 - S. Raghavan, Rui Zhang:
Influence Maximization with Latency Requirements on Social Networks. 710-728 - Nilay Noyan, Gábor Rudolf, Miguel A. Lejeune:
Distributionally Robust Optimization Under a Decision-Dependent Ambiguity Set with Applications to Machine Scheduling and Humanitarian Logistics. 729-751 - Dongwook Shin, Mark Broadie, Assaf Zeevi:
Practical Nonparametric Sampling Strategies for Quantile-Based Ordinal Optimization. 752-768 - Junming Liu, Weiwei Chen, Jingyuan Yang, Hui Xiong, Can Chen:
Iterative Prediction-and-Optimization for E-Logistics Distribution Network Design. 769-789 - Yuheng Hu, Yili Hong:
SHEDR: An End-to-End Deep Neural Event Detection and Recommendation Framework for Hyperlocal News Using Social Media. 790-806 - David Bergman, Teng Huang, Philip Brooks, Andrea Lodi, Arvind U. Raghunathan:
JANOS: An Integrated Predictive and Prescriptive Modeling Framework. 807-816 - Xinyun Wu, Zhipeng Lü, Fred W. Glover:
A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets. 817-833 - Liting Chen, Sebastian Wandelt, Weibin Dai, Xiaoqian Sun:
Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region. 834-856 - Ayse N. Arslan, Boris Detienne:
Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems. 857-871 - Daniel Rehfeldt, Thorsten Koch:
On the Exact Solution of Prize-Collecting Steiner Tree Problems. 872-889 - Claudio Contardo, Jorge A. Sefair:
A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games. 890-908 - Nathan Adelgren, Akshay Gupte:
Branch-and-Bound for Biobjective Mixed-Integer Linear Programming. 909-933 - Gregor Hendel, Daniel Anderson, Pierre Le Bodic, Marc E. Pfetsch:
Estimating the Size of Branch-and-Bound Trees. 934-952 - Miao Yu, Viswanath Nagarajan, Siqian Shen:
Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization. 953-973 - John Pavlik, Edward C. Sewell, Sheldon H. Jacobson:
Iterative Deepening Dynamically Improved Bounds Bidirectional Search. 974-989 - David Bergman, Merve Bodur, Carlos Cardonha, André A. Ciré:
Network Models for Multiobjective Discrete Optimization. 990-1005 - Stefano Coniglio, Stefano Gualandi:
Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming. 1006-1023 - Franco Quezada, Céline Gicquel, Safia Kedad-Sidhoum:
Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty. 1024-1041 - John Alasdair Warwicker, Steffen Rebennack:
A Comparison of Two Mixed-Integer Linear Programs for Piecewise Linear Function Fitting. 1042-1047 - Yantong Li, Jean-François Côté, Leandro C. Coelho, Peng Wu:
Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem. 1048-1069 - Saharnaz Mehrani, Carlos Cardonha, David Bergman:
Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation. 1070-1085 - Edward Yuhang He, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh:
Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems. 1086-1114 - Riley Badenbroek, Etienne de Klerk:
An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix. 1115-1125 - Dewei Zhang, Yin Liu, Sam Davanloo Tajbakhsh:
A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure. 1126-1140 - Luciano Costa, Claudio Contardo, Guy Desaulniers, Julian Yarkony:
Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows. 1141-1156 - Alexander Jungwirth, Guy Desaulniers, Markus M. Frey, Rainer Kolisch:
Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity. 1157-1175 - Amir Ali Nasrollahzadeh, Amin Khademi:
Dynamic Programming for Response-Adaptive Dose-Finding Clinical Trials. 1176-1190 - Bart Smeulders, Valentin Bartier, Yves Crama, Frits C. R. Spieksma:
Recourse in Kidney Exchange Programs. 1191-1206 - Miao Bai, Robert H. Storer, Gregory L. Tonkay:
Surgery Sequencing Coordination with Recovery Resource Constraints. 1207-1223 - Na Geng, Xiaolan Xie:
Managing Advance Admission Requests for Obstetric Care. 1224-1239 - Ali Adibi, Ehsan Salari:
Scalable Optimization Methods for Incorporating Spatiotemporal Fractionation into Intensity-Modulated Radiotherapy Planning. 1240-1256 - Shaojie Tang, Siyuan Liu, Xu Han, Yu Qiao:
Toward Robust Monitoring of Malicious Outbreaks. 1257-1271 - Kaike Zhang, Xueping Li, Mingzhou Jin:
Efficient Solution Methods for a General r-Interdiction Median Problem with Fortification. 1272-1290 - Christoph Helmberg, Tobias Hofmann, David Wenzel:
Periodic Event Scheduling for Automated Production Systems. 1291-1304
Volume 34, Number 3, May - June 2022
- Alice E. Smith:
Note from the Editor. 1305
- Fred W. Glover:
Unforeseen Consequences of "Tabu" Choices - A Retrospective. 1306-1308 - Hosseinali Salemi, Austin Buchanan:
Solving the Distance-Based Critical Node Problem. 1309-1326 - Sunil Chopra, Hyunwoo Park, Sangho Shim:
Extended Graph Formulation for the Inequity Aversion Pricing Problem on Social Networks. 1327-1344 - S. Raghavan, Rui Zhang:
Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem. 1345-1365 - Kelsey Maass, Minsun Kim, Aleksandr Y. Aravkin:
A Nonconvex Optimization Approach to IMRT Planning with Dose-Volume Constraints. 1366-1386 - Martijn H. H. Schoot Uiterkamp, Marco E. T. Gerards, Johann L. Hurink:
On a Reduction for a Class of Resource Allocation Problems. 1387-1402 - Chuangyin Dang, P. Jean-Jacques Herings, Peixuan Li:
An Interior-Point Differentiable Path-Following Method to Compute Stationary Equilibria in Stochastic Games. 1403-1418 - Xiangyi Zhang, Lu Chen, Michel Gendreau, André Langevin:
Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints. 1419-1436 - Felix Happach, Lisa Hellerstein, Thomas Lidbetter:
A General Framework for Approximating Min Sum Ordering Problems. 1437-1452 - Vahid Mahmoodian, Iman Dayarian, Payman Ghasemi Saghand, Yu Zhang, Hadi Charkhgard:
A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs. 1453-1470 - Merve Bodur, Timothy C. Y. Chan, Ian Yihang Zhu:
Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods. 1471-1488 - Dimitris Bertsimas, Ryan Cory-Wright:
A Scalable Algorithm for Sparse Portfolio Selection. 1489-1511 - Artur Alves Pessoa, Teobaldo Bulhões, Vitor Nesello, Anand Subramanian:
Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling. 1512-1530 - Yiling Zhang, Jin Dong:
Building Load Control Using Distributionally Robust Chance-Constrained Programs with Right-Hand Side Uncertainty and the Risk-Adjustable Variants. 1531-1547 - Tristan Becker, Maximilian Schiffer, Grit Walther:
A General Branch-and-Cut Framework for Rotating Workforce Scheduling. 1548-1564 - Siyuan Liu, Shaojie Tang, Jiangchuan Zheng, Lionel M. Ni:
Unsupervised Learning for Human Mobility Behaviors. 1565-1586 - Haifeng Xu, Rasha F. Kashef, Hans De Sterck, Geoffrey Sanders:
Efficient Algebraic Multigrid Methods for Multilevel Overlapping Coclustering of User-Item Relationships. 1587-1605 - Sanjay Dominik Jena, Andrea Lodi, Claudio Sole:
On the Estimation of Discrete Choice Models to Capture Irrational Customer Behaviors. 1606-1625 - Tong Wang, Cynthia Rudin:
Causal Rule Sets for Identifying Subgroups with Enhanced Treatment Effects. 1626-1643 - Xuan Bi, Gediminas Adomavicius, William Li, Annie Qu:
Improving Sales Forecasting Accuracy: A Tensor Factorization Approach with Demand Awareness. 1644-1660 - Yicheng Song, Nachiketa Sahoo, Shuba Srinivasan, Chrysanthos Dellarocas:
Uncovering Characteristic Response Paths of a Population. 1661-1680 - Wouter van Eekelen, Dick den Hertog, Johan S. H. van Leeuwaarden:
MAD Dispersion Measure Makes Extremal Queue Analysis Simple. 1681-1692 - Amir Rastpour, Armann Ingolfsson, Burhaneddin Sandikçi:
Algorithms for Queueing Systems with Reneging and Priorities Modeled as Quasi-Birth-Death Processes. 1693-1710 - David J. Eckman, Shane G. Henderson:
Posterior-Based Stopping Rules for Bayesian Ranking-and-Selection Procedures. 1711-1728 - Pierre L'Ecuyer, Florian Puchhammer, Amal Ben Abdellah:
Monte Carlo and Quasi-Monte Carlo Density Estimation via Conditioning. 1729-1748 - Geunyeong Byeon, Pascal Van Hentenryck:
Benders Subproblem Decomposition for Bilevel Problems with Convex Follower. 1749-1767 - Meysam Cheramin, Jianqiang Cheng, Ruiwei Jiang, Kai Pan:
Computationally Efficient Approximations for Distributionally Robust Optimization Under Moment and Wasserstein Ambiguity. 1768-1794 - Ricardo M. Lima, Antonio J. Conejo, Loïc Giraldi, Olivier P. Le Maître, Ibrahim Hoteit, Omar M. Knio:
Risk-Averse Stochastic Programming vs. Adaptive Robust Optimization: A Virtual Power Plant Application. 1795-1818 - Kai Pan, Yongpei Guan:
Integrated Stochastic Optimal Self-Scheduling for Two-Settlement Electricity Markets. 1819-1840
Volume 34, Number 4, July - August 2022
- Alice E. Smith:
Note from the Editor. 1841
- Lan Peng, Chase C. Murray:
VeRoViz: A Vehicle Routing Visualization Toolkit. 1842-1848 - Zachary Steever, Chase C. Murray, Junsong Yuan, Mark H. Karwan, Marco E. Lübbecke:
An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs. 1849-1870 - Alfredo Torrico, Alejandro Toriello:
Dynamic Relaxations for Online Bipartite Matching. 1871-1884 - Martin Biel, Mikael Johansson:
Efficient Stochastic Programming in Julia. 1885-1902 - Weiguo Zhang, Xiaolei He:
A New Scenario Reduction Method Based on Higher-Order Moments. 1903-1918 - Zhouchun Huang, Qipeng P. Zheng, Andrew L. Liu:
A Nested Cross Decomposition Algorithm for Power System Capacity Expansion with Multiscale Uncertainties. 1919-1939 - Hu Tian, Xiaolong Zheng, Kang Zhao, Maggie Wenjing Liu, Daniel Dajun Zeng:
Inductive Representation Learning on Dynamic Stock Co-Movement Graphs for Stock Predictions. 1940-1957 - Xi Chen, Yan Liu, Cheng Zhang:
Distinguishing Homophily from Peer Influence Through Network Representation Learning. 1958-1969 - Dilson Lucas Pereira, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti:
Exact Solution Algorithms for the Chordless Cycle Problem. 1970-1986 - Marco Casazza, Alberto Ceselli:
Exact Algorithms for Maximum Lifetime Data-Gathering Tree in Wireless Sensor Networks. 1987-2002 - Luis Henrique Pauleti Mendes, Fábio Luiz Usberti, Celso Cavellucci:
The Capacitated and Economic Districting Problem. 2003-2016 - Danielle A. Ripsman, Thomas G. Purdie, Timothy C. Y. Chan, Houra Mahmoudzadeh:
Robust Direct Aperture Optimization for Radiation Therapy Treatment Planning. 2017-2038 - Zeyu Liu, Anahita Khojandi, Xueping Li, Akram Mohammed, Robert L. Davis, Rishikesan Kamaleswaran:
A Machine Learning-Enabled Partially Observable Markov Decision Process Framework for Early Sepsis Prediction. 2039-2057 - Vincent Tsz Fai Chow, Zheng Cui, Daniel Zhuoyu Long:
Target-Oriented Distributionally Robust Optimization and Its Applications to Surgery Allocation. 2058-2072 - Yifu Chen, Christos T. Maravelias:
Variable Bound Tightening and Valid Constraints for Multiperiod Blending. 2073-2090 - Aras Selvi, Aharon Ben-Tal, Ruud Brekelmans, Dick den Hertog:
Convex Maximization via Adjustable Robust Optimization. 2091-2105 - Martina Kuchlbauer, Frauke Liers, Michael Stingl:
Adaptive Bundle Methods for Nonlinear Robust Optimization. 2106-2124 - Naomi Graham, Hao Hu, Jiyoung Im, Xinxin Li, Henry Wolkowicz:
A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP. 2125-2143 - Veronica Piccialli, Antonio Maria Sudoso, Angelika Wiegele:
SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering. 2144-2162 - Endric Daues, Ulf Friedrich:
Computing Optimized Path Integrals for Knapsack Feasibility. 2163-2176 - Karim Y. P. Martínez, Yossiri Adulyasak, Raf Jans:
Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems. 2177-2191 - Martin Wölck, Stephan Meisel:
Branch-and-Price Approaches for Real-Time Vehicle Routing with Picking, Loading, and Soft Time Windows. 2192-2211 - Ayse N. Arslan, Michael Poss, Marco Silva:
Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions. 2212-2228 - Dimitris Bertsimas, Bartolomeo Stellato:
Online Mixed-Integer Optimization in Milliseconds. 2229-2248 - Orlando Rivera Letelier, François Clautiaux, Ruslan Sadykov:
Bin Packing Problem with Time Lags. 2249-2270 - Margarita P. Castro, André Augusto Ciré, J. Christopher Beck:
Decision Diagrams for Discrete Optimization: A Survey of Recent Advances. 2271-2295 - Emma Savannah Johnson, Santanu S. Dey:
A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid. 2296-2312 - Adil Tahir, Guy Desaulniers, Issmail El Hallaoui:
Integral Column Generation for Set Partitioning Problems with Side Constraints. 2313-2331 - Rui Chen, James R. Luedtke:
On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs. 2332-2349 - Zhaolin Hu, L. Jeff Hong:
Robust Simulation with Likelihood-Ratio Constrained Input Uncertainty. 2350-2367 - Lucy E. Morgan, Luke Rhodes-Leader, Russell R. Barton:
Reducing and Calibrating for Input Model Bias in Computer Simulation. 2368-2382
Volume 34, Number 5, September - October 2022
- Alice E. Smith:
Note from the Editor. 2383
- Katya Scheinberg:
Finite Difference Gradient Approximation: To Randomize or Not? 2384-2388 - Arden Baxter, Pinar Keskinocak, Mohit Singh:
Heterogeneous Multi-resource Allocation with Subset Demand Requests. 2389-2399 - Dimitris Bertsimas, Michael Lingzhi Li:
Stochastic Cutting Planes for Data-Driven Optimization. 2400-2409 - Jianzhe Zhen, Ahmadreza Marandi, Danique de Moor, Dick den Hertog, Lieven Vandenberghe:
Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective. 2410-2427 - Özgün Elçi, John N. Hooker:
Stochastic Planning and Scheduling with Logic-Based Benders Decomposition. 2428-2442 - Qingxin Meng, Keli Xiao, Dazhong Shen, Hengshu Zhu, Hui Xiong:
Fine-Grained Job Salary Benchmarking with a Nonparametric Dirichlet Process-Based Latent Factor Model. 2443-2463 - Menghan Liu, Erik Poppleton, Giulia Pedrielli, Petr Sulc, Dimitri P. Bertsekas:
ExpertRNA: A New Framework for RNA Secondary Structure Prediction. 2464-2484 - Kimia Keshanian, Daniel Zantedeschi, Kaushik Dutta:
Features Selection as a Nash-Bargaining Solution: Applications in Online Advertising and Information Systems. 2485-2501 - Jan Gmys:
Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers. 2502-2522 - Wei Wu, Manuel Iori, Silvano Martello, Mutsunori Yagiura:
An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion. 2523-2539 - Martin B. Haugh, Chun Wang:
Play Like the Pros? Solving the Game of Darts as a Dynamic Zero-Sum Game. 2540-2551 - Quentin Cappart, David Bergman, Louis-Martin Rousseau, Isabeau Prémont-Schwarz, Augustin Parjadis:
Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning. 2552-2570 - Naga Venkata C. Gudapati, Enrico Malaguti, Michele Monaci:
Network Design with Service Requirements: Scaling-up the Size of Solvable Problems. 2571-2582 - Ramin Moghaddass, Yongtao Guan:
Optimal Frameworks for Detecting Anomalies in Sensor-Intensive Heterogeneous Networks. 2583-2610 - Mathieu Besançon, Alejandro Carderera, Sebastian Pokutta:
FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank-Wolfe Algorithms and Conditional Gradients. 2611-2620 - Amir Ahmadi-Javid, Pooya Hoseinpour:
Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion. 2621-2633 - Kübra Taninmis, Markus Sinnl:
A Branch-and-Cut Algorithm for Submodular Interdiction Games. 2634-2657 - Quang Minh Bui, Bernard Gendron, Margarida Carvalho:
A Catalog of Formulations for the Network Pricing Problem. 2658-2674 - Zhao Zhang, Wei Liang, Hongmin W. Du, Siwen Liu:
Constant Approximation for the Lifetime Scheduling Problem of p-Percent Coverage. 2675-2685 - Chris Coey, Lea Kapelevich, Juan Pablo Vielma:
Solving Natural Conic Formulations with Hypatia.jl. 2686-2699 - Maryam Daryalal, Merve Bodur:
Stochastic RWA and Lightpath Rerouting in WDM Networks. 2700-2719 - Rishabh Gupta, Qi Zhang:
Decomposition and Adaptive Sampling for Data-Driven Inverse Linear Optimization. 2720-2735 - Daniel Porumbel:
Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems. 2736-2753 - Michele Samorani, Ram Bala, Rohit Jacob, Shuhan He:
A Software Package and Data Set for the Personal Protective Equipment Matching Problem During COVID-19. 2754-2761 - Zemin Zheng, Jie Zhang, Yang Li:
L0-Regularized Learning for High-Dimensional Additive Hazards Regression. 2762-2775 - Tianqi Liu, Francisco Saldanha-da-Gama, Shuming Wang, Yuchen Mao:
Robust Stochastic Facility Location: Sensitivity Analysis and Exact Solution. 2776-2803 - Kiho Seo, Seulgi Joung, Chungmok Lee, Sungsoo Park:
A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm. 2804-2827 - Rahman Khorramfar, Osman Y. Özaltin, Karl G. Kempf, Reha Uzsoy:
Managing Product Transitions: A Bilevel Programming Approach. 2828-2844 - Tito Homem-de-Mello, Qingxia Kong, Rodrigo Godoy-Barba:
A Simulation Optimization Approach for the Appointment Scheduling Problem with Decision-Dependent Uncertainties. 2845-2865
Volume 34, Number 6, November - December 2022
- Alice E. Smith:
Note from the Editor. 2867 - Illya V. Hicks, Boris Brimkov, Louis Deaett, Ruth Haas, Derek Mikesell, David E. Roberson, Logan A. Smith:
Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph. 2868-2872 - Phebe Vayanos, Qing Jin, George Elissaios:
ROC++: Robust Optimization in C++. 2873-2888 - Jiaqiao Hu, Yijie Peng, Gongbo Zhang, Qi Zhang:
A Stochastic Approximation Method for Simulation-Based Quantile Optimization. 2889-2907 - Yanchao Liu:
bsnsing: A Decision Tree Induction Method Based on Recursive Optimal Boolean Rule Composition. 2908-2929 - L. Jeff Hong, Guangxin Jiang, Ying Zhong:
Solving Large-Scale Fixed-Budget Ranking and Selection Problems. 2930-2949 - Jason Rhuggenaath, Alp Akcay, Yingqian Zhang, Uzay Kaymak:
Setting Reserve Prices in Second-Price Auctions with Unobserved Bids. 2950-2967 - Carina Moreira Costa, Dennis Kreber, Martin Schmidt:
An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems. 2968-2988 - Liwei Zhang, Yule Zhang, Jia Wu, Xiantao Xiao:
Solving Stochastic Optimization with Expectation Constraints Efficiently by a Stochastic Augmented Lagrangian-Type Algorithm. 2989-3006 - Nicolau Andrés-Thió, Mario Andrés Muñoz, Kate Smith-Miles:
Bifidelity Surrogate Modelling: Showcasing the Need for New Test Instances. 3007-3022 - Md. Saiful Islam, Md Sarowar Morshed, Md. Noor-E.-Alam:
A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference. 3023-3041 - Alessandro Hill, Andrea J. Brickey, Italo Cipriano, Marcos Goycoolea, Alexandra M. Newman:
Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining. 3042-3058 - Guopeng Song, Roel Leus:
Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms. 3059-3079 - Yuwei Zhou, Sigrún Andradóttir, Seong-Hee Kim, Chuljin Park:
Finding Feasible Systems for Subjective Constraints Using Recycled Observations. 3080-3095 - Shao-Bo Lin, Shaojie Tang, Yao Wang, Di Wang:
Toward Efficient Ensemble Learning with Structure Constraints: Convergent Algorithms and Applications. 3096-3116 - Marianna De Santis, Sven de Vries, Martin Schmidt, Lukas Winkel:
A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems. 3117-3133 - Olivier Lalonde, Jean-François Côté, Bernard Gendron:
A Branch-and-Price Algorithm for the Multiple Knapsack Problem. 3134-3150 - Simon Thevenin, Yossiri Adulyasak, Jean-François Cordeau:
Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution. 3151-3169 - Gordon B. Hazen:
Augmenting Markov Cohort Analysis to Compute (Co)Variances: Implications for Strength of Cost-Effectiveness. 3170-3180 - Yajun Lu, Hosseinali Salemi, Balabhaskar Balasundaram, Austin Buchanan:
On Fault-Tolerant Low-Diameter Clusters in Graphs. 3181-3199 - Aharon Ben-Tal, Ernst Roos:
An Algorithm for Maximizing a Convex Function Based on Its Minimum. 3200-3214 - Qinxiao Yu, Chun Cheng, Ning Zhu:
Robust Team Orienteering Problem with Decreasing Profits. 3215-3233 - Jiateng Yin, Lixing Yang, Andrea D'Ariano, Tao Tang, Ziyou Gao:
Integrated Backup Rolling Stock Allocation and Timetable Rescheduling with Uncertain Time-Variant Passenger Demand Under Disruptive Events. 3234-3258 - Ronilo J. Ragodos, Tong Wang:
Disjunctive Rule Lists. 3259-3276 - Shaojie Tang:
Robust Adaptive Submodular Maximization. 3277-3291 - Gonzalo Lera-Romero, Juan José Miranda Bront, Francisco J. Soulignac:
Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows. 3292-3308 - Kai Pan, Ming Zhao, Chung-Lun Li, Feng Qiu:
A Polyhedral Study on Fuel-Constrained Unit Commitment. 3309-3324 - Pitchaya Wiratchotisatian, Hoda Atef Yekta, Andrew C. Trapp:
Stability Representations of Many-to-One Matching Problems: An Integer Optimization Approach. 3325-3343
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-07 00:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
