default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDINFORMS Journal on Computing, Volume 33
Volume 33, Number 1, Winter 2021
- Alice E. Smith
:
Note from the Editor. 1
- Phillip R. Jenkins, Matthew J. Robbins, Brian J. Lunday:
Approximate Dynamic Programming for Military Medical Evacuation Dispatching Policies. 2-26 - Oscar Dowson, Lea Kapelevich:
SDDP.jl: A Julia Package for Stochastic Dual Dynamic Programming. 27-33 - Timo Lohmann, Michael R. Bussieck, Lutz Westermann, Steffen Rebennack:
High-Performance Prototyping of Decomposition Methods in GAMS. 34-50 - Harsha Gangammanavar, Yifan Liu, Suvrajeet Sen:
Stochastic Decomposition for Two-Stage Stochastic Linear Programs with Random Cost Coefficients. 51-71 - Satya Tamby, Daniel Vanderpooten:
Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems. 72-85 - Wenjun Ni, Jia Shu, Miao Song, Dachuan Xu, Kaike Zhang:
A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions. 86-104 - Guopeng Song, Tamás Kis, Roel Leus:
Polyhedral Results and Branch-and-Cut for the Resource Loading Problem. 105-119 - Young Woong Park:
Optimization for L1-Norm Error Fitting via Data Aggregation. 120-142 - Hossein Hashemi Doulabi, Patrick Jaillet, Gilles Pesant, Louis-Martin Rousseau:
Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios. 143-162 - Xiaojin Zheng, Yutong Pan, Zhaolin Hu:
Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs. 163-179 - Hezhi Luo, Xiaodong Ding, Jiming Peng, Rujun Jiang, Duan Li:
Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties. 180-197 - Thomas Kleinert, Martin Schmidt:
Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method. 198-215 - Ning Cai, Xuewei Yang:
A Computational Approach to First Passage Problems of Reflected Hyperexponential Jump Diffusion Processes. 216-229 - Yijie Peng, Chun-Hung Chen, Michael C. Fu, Jian-Qiang Hu, Ilya O. Ryzhov:
Efficient Sampling Allocation Procedures for Optimal Quantile Selection. 230-245 - Xunhua Guo, Guoqing Chen, Cong Wang, Qiang Wei, Zunqiang Zhang:
Calibration of Voting-Based Helpfulness Measurement for Online Reviews: An Iterative Bayesian Probability Approach. 246-261 - Dimitris Bertsimas, Nishanth Mundru:
Sparse Convex Regression. 262-279 - Jin Zhang, Cong Wang, Guoqing Chen:
A Review Selection Method for Finding an Informative Subset from Online Reviews. 280-299 - Ethem Çanakoglu, Ibrahim Muter, Tevfik Aytekin:
Integrating Individual and Aggregate Diversity in Top-N Recommendation. 300-318 - Zu-Jun Ma, Fei Yang, Ying Dai, Zuo-Jun Max Shen:
The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm. 319-335 - Haoxiang Yang, David P. Morton, Chaithanya Bandi, Krishnamurthy Dvijotham:
Robust Optimization for Electricity Generation. 336-351 - Jianqiu Huang, Kai Pan, Yongpei Guan:
Multistage Stochastic Power Generation Scheduling Co-Optimizing Energy and Ancillary Services. 352-369 - Anulekha Dhara, Bikramjit Das, Karthik Natarajan:
Worst-Case Expected Shortfall with Univariate and Bivariate Marginals. 370-389 - Ward Romeijnders, Krzysztof Postek:
Piecewise Constant Decision Rules via Branch-and-Bound Based Scenario Detection for Integer Adjustable Robust Optimization. 390-400 - David Bergman, Leonardo Lozano:
Decision Diagram Decomposition for Quadratically Constrained Binary Optimization. 401-418
Volume 33, Number 2, Spring 2021
- Alice E. Smith:
Note from the Editor. 419-420
- Timo Berthold, Jakob Witzig:
Conflict Analysis for MINLP. 421-435 - Dominik Goeke, Michael Schneider:
Modeling Single-Picker Routing Problems in Classical and Modern Warehouses. 436-451 - Zhixing Luo, Hu Qin, T. C. E. Cheng, Qinghua Wu, Andrew Lim:
A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants. 452-476 - Dirk Briskorn, Malte Fliedner, Martin Tschöke:
Vehicle Sequencing at Transshipment Terminals with Handover Relations. 477-494 - Kevin Dalmeijer, Guy Desaulniers:
Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem. 495-510 - Shan Jiang, Shu-Cherng Fang, Qingwei Jin:
Sparse Solutions by a Quadratically Constrained ℓ q (0 q < 1) Minimization Model. 511-530 - Dzung T. Phan, Matt Menickelly:
On the Solution of ℓ0-Constrained Sparse Inverse Covariance Estimation Problems. 531-550 - Andrés Gómez, Oleg A. Prokopyev:
A Mixed-Integer Fractional Optimization Approach to Best Subset Selection. 551-565 - Yichen Cheng, Xinlei Wang, Yusen Xia:
Supervised t-Distributed Stochastic Neighbor Embedding for Data Visualization and Classification. 566-585 - Jiapeng Liu, Milosz Kadzinski, Xiuwu Liao, Xiaoxin Mao:
Data-Driven Preference Learning Methods for Value-Driven Multiple Criteria Sorting with Interacting Criteria. 586-606 - Amir Ali Ahmadi, Jeffrey Zhang:
Semidefinite Programming and Nash Equilibria in Bimatrix Games. 607-628 - A. D. López-Sánchez, Jesús Sánchez-Oro, Manuel Laguna:
A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location. 629-642 - Fatemeh Sarayloo, Teodor Gabriel Crainic, Walter Rei:
A Learning-Based Matheuristic for Stochastic Multicommodity Network Design. 643-656 - Demet Batur, F. Fred Choobineh:
Selecting the Best Alternative Based on Its Quantile. 657-671 - Barry L. Nelson, Alan T. K. Wan, Guohua Zou, Xinyu Zhang, Xi Jiang:
Reducing Simulation Input-Model Risk via Input Model Averaging. 672-684 - Filipe Rodrigues, Agostinho Agra, Cristina Requejo, Erick Delage:
Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem. 685-705 - Jakob Witzig, Ambros M. Gleixner:
Conflict-Driven Heuristics for Mixed Integer Programming. 706-720 - Amin Hosseininasab, Willem-Jan van Hoeve:
Exact Multiple Sequence Alignment by Synchronized Decision Diagrams. 721-738 - Álinson S. Xavier, Feng Qiu, Shabbir Ahmed:
Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems. 739-756 - Yan Deng, Huiwen Jia, Shabbir Ahmed, Jon Lee, Siqian Shen:
Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs. 757-773 - Yingli Ran, Zhao Zhang, Shaojie Tang, Ding-Zhu Du:
Breaking the rmax Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem. 774-784 - Alexander S. Estes, Michael O. Ball:
Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem. 785-807 - Eyyüb Y. Kibis, I. Esra Büyüktahtakin, Robert G. Haight, Najmaddin Akhundov, Kathleen Knight, Charles E. Flower:
A Multistage Stochastic Programming Approach to the Optimal Surveillance and Control of the Emerald Ash Borer in Cities. 808-834 - Natashia Boland, Riley Clement, Hamish Waterer:
Corrigendum to "A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems, " INFORMS Journal on Computing 28(1): 14-30, 2016. 835
Volume 33, Number 3, Summer 2021
- Alice E. Smith:
Note from the Editor. 837-838
- Cihan Tugrul Cicek, Zuo-Jun Max Shen, Hakan Gultekin, Bülent Tavli:
3-D Dynamic UAV Base Station Location Problem. 839-860 - Margarida Carvalho, Xenia Klimentova, Kristiaan Glorie, Ana Viana, Miguel Constantino:
Robust Models for the Kidney Exchange Problem. 861-881 - Shen Liu, Hongyan Liu:
Tagging Items Automatically Based on Both Content Information and Browsing Behaviors. 882-897 - Zhicheng Zhu, Yisha Xiang, Bo Zeng:
Multicomponent Maintenance Optimization: A Stochastic Programming Approach. 898-914 - Mark Semelhago, Barry L. Nelson, Eunhye Song, Andreas Wächter:
Rapid Discrete Optimization via Simulation with Gaussian Markov Random Fields. 915-930 - Yasemin Merzifonluoglu, Joseph Geunes:
The Risk-Averse Static Stochastic Knapsack Problem. 931-948 - Philippe Olivier, Andrea Lodi, Gilles Pesant:
The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints. 949-962 - Jean-François Côté, Mohamed Haouari, Manuel Iori:
Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem. 963-978 - Yang Wang, Wei Yang, Abraham P. Punnen, Jingbo Tian, Aihua Yin, Zhipeng Lü:
The Rank-One Quadratic Assignment Problem. 979-996 - Edward He, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh:
Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting. 997-1014 - Roya Karimi, Jianqiang Cheng, Miguel A. Lejeune:
A Framework for Solving Chance-Constrained Linear Matrix Inequality Programs. 1015-1036 - Chao Li, Muhong Zhang, Kory W. Hedman:
Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty. 1037-1055 - Xiaodi Bai, Jie Sun, Xiaojin Zheng:
An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems. 1056-1069 - Timo Gschwind, Stefan Irnich, Fabio Furini, Roberto Wolfler Calvo:
A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques. 1070-1090 - Wenda Zhang, Jason J. Sauppe, Sheldon H. Jacobson:
An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints. 1091-1102 - Miten Mistry, Dimitrios Letsios, Gerhard Krennrich, Robert M. Lee, Ruth Misener:
Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded. 1103-1119 - Ran Ji, Miguel A. Lejeune:
Data-Driven Optimization of Reward-Risk Ratio Measures. 1120-1137 - Amir Ardestani-Jaafari, Erick Delage:
Linearized Robust Counterparts of Two-Stage Robust Optimization Problems with Applications in Operations Management. 1138-1161 - Nihal Berktas, Hande Yaman:
A Branch-and-Bound Algorithm for Team Formation on Social Networks. 1162-1176 - Zifeng Zhao, Peng Shi, Xiaoping Feng:
Knowledge Learning of Insurance Risks Using Dependence Models. 1177-1196 - Zeyang Wu, Kameng Nip, Qie He:
A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints. 1197-1212 - Jungho Park, Hadi El-Amine, Nevin Mutlu:
An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives. 1213-1228 - Jie Zhang, Weijun Xie, Subhash C. Sarin:
Multiproduct Newsvendor Problem with Customer-Driven Demand Substitution: A Stochastic Integer Program Perspective. 1229-1244 - Debdatta Sinha Roy, Adriano Masone, Bruce L. Golden, Edward A. Wasil:
Modeling and Solving the Intersection Inspection Rural Postman Problem. 1245-1257
Volume 33, Number 4, Fall 2021
- Alice E. Smith:
Note from the Editor. 1259-1261
- Frank de Meijer, Renata Sotirov:
SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning. 1262-1276 - Nicholas D. Kullman, Aurélien Froger, Jorge E. Mendoza, Justin C. Goodson:
frvcpy: An Open-Source Solver for the Fixed Route Vehicle Charging Problem. 1277-1283 - Arne Herzel, Stefan Ruzika, Clemens Thielen:
Approximation Methods for Multiobjective Optimization Problems: A Survey. 1284-1299 - Alexander J. Zolan, Michael S. Scioletti, David P. Morton, Alexandra M. Newman:
Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design. 1300-1319 - Yuheng Hu:
Characterizing Social TV Activity Around Televised Events: A Joint Topic Model Approach. 1320-1338 - Yining Wang, Yi Wu, Simon S. Du:
Near-Linear Time Local Polynomial Nonparametric Estimation with Box Kernels. 1339-1353 - Yu Yang, Natashia Boland, Martin W. P. Savelsbergh:
Multivariable Branching: A 0-1 Knapsack Problem Case Study. 1354-1367 - Xiaoli Cen, Yong Xia:
A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity. 1368-1383 - Boris Brimkov, Derek Mikesell, Illya V. Hicks:
Improved Computational Approaches and Heuristics for Zero Forcing. 1384-1399 - Fan Zhou, Kunpeng Zhang, Bangying Wu, Yi Yang, Harry Jiannan Wang:
Unifying Online and Offline Preference for Social Link Prediction. 1400-1418 - Michael Jünger, Sven Mallach:
Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization. 1419-1430 - Xiaojun Zhu, Shaojie Tang:
Exact Algorithms for the Minimum Load Spanning Tree Problem. 1431-1445 - Xiaojun Zhu, Shaojie Tang:
A Branch-and-Bound Algorithm for Building Optimal Data Gathering Tree in Wireless Sensor Networks. 1446-1460 - Ningji Wei, Jose L. Walteros, Foad Mahdavi Pajouh:
Integer Programming Formulations for Minimum Spanning Tree Interdiction. 1461-1480 - Colin P. Gillen, Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao:
Fortification Against Cascade Propagation Under Uncertainty. 1481-1499 - Haihui Shen, L. Jeff Hong, Xiaowei Zhang:
Ranking and Selection with Covariates for Personalized Decision Making. 1500-1519 - Peter W. Glynn, Yijie Peng, Michael C. Fu, Jian-Qiang Hu:
Computing Sensitivities for Distortion Risk Measures. 1520-1532 - Antonio J. Conejo, Nicholas G. Hall, Daniel Zhuoyu Long, Runhao Zhang:
Robust Capacity Planning for Project Management. 1533-1550 - Cheng Guo, Merve Bodur, Dionne M. Aleman, David R. Urbach:
Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling. 1551-1569 - Juan Sebastian Borrero, Leonardo Lozano:
Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets. 1570-1589 - Alfredo Torrico, Mohit Singh, Sebastian Pokutta, Nika Haghtalab, Joseph (Seffi) Naor, Nima Anari:
Structured Robust Submodular Maximization: Offline and Online Algorithms. 1590-1607 - Daniel Zeng, Yong Liu, Ping Yan, Yanwu Yang:
Location-Aware Real-Time Recommender Systems for Brick-and-Mortar Retailers. 1608-1623 - Álinson S. Xavier, Ricardo Fukasawa, Laurent Poirrier:
Multirow Intersection Cuts Based on the Infinity Norm. 1624-1643 - Junlong Zhang, Osman Y. Özaltin:
Bilevel Integer Programs with Stochastic Right-Hand Sides. 1644-1660 - Shanshan Wang, Jinlin Li, Sanjay Mehrotra:
Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning. 1661-1677
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 2024-10-31 20:03 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:
