default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDINFORMS Journal on Computing, Volume 30
Volume 30, Number 1, Winter 2018
- Qi-Ming He
, Attahiru Sule Alfa:
Space Reduction for a Class of Multidimensional Markov Chains: A Summary and Some Applications. 1-10 - Yuji Shinano, Stefan Heinz, Stefan Vigerske, Michael Winkler:
FiberSCIP - A Shared Memory Parallelization of SCIP. 11-30 - Jianzhe Zhen, Dick den Hertog:
Computing the Maximum Volume Inscribed Ellipsoid of a Polytopic Projection. 31-42 - Betül Ahat, Tínaz Ekim, Z. Caner Taskin:
Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem. 43-56 - Wim van Ackooij, Welington de Oliveira, Yongjia Song:
Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse. 57-70 - Ni Ma, Ward Whitt:
A Rare-Event Simulation Algorithm for Periodic Single-Server Queues. 71-89 - Yan Deng, Shabbir Ahmed, Siqian Shen:
Parallel Scenario Decomposition of Risk-Averse 0-1 Stochastic Programs. 90-105 - Daniel F. Salas, Warren B. Powell:
Benchmarking a Scalable Approximate Dynamic Programming Algorithm for Stochastic Control of Grid-Level Energy Storage. 106-123 - Lehilton L. C. Pedrosa, Maxim Sviridenko:
Integrated Supply Chain Management via Randomized Rounding. 124-136 - Chu-Min Li, Zhiwen Fang, Hua Jiang, Ke Xu:
Incremental Upper Bound for the Maximum Clique Problem. 137-153 - Enlu Zhou, Shalabh Bhatnagar:
Gradient-Based Adaptive Stochastic Search for Simulation Optimization Over Continuous Space. 154-167 - Roberto Cordone, Pierre Hosteins, Giovanni Righini:
A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization. 168-180 - Song-Hee Kim, Ward Whitt, Won Chul Cha:
A Data-Driven Model of an Appointment-Generated Arrival Process at an Outpatient Clinic. 181-199 - Robin C. Ball, Jürgen Branke, Stephan Meisel:
Optimal Sampling for Simulated Annealing Under Noise. 200-215
Volume 30, Number 2, Spring 2018
- Zhao Zhang, Jiao Zhou, Shaojie Tang, Xiaohui Huang, Ding-Zhu Du:
Computing Minimum k-Connected m-Fold Dominating Set in General Graphs. 217-224 - Jiao Zhou, Zhao Zhang, Shaojie Tang, Xiaohui Huang, Ding-Zhu Du:
Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set. 225-235 - Tao Wu, Zhe Liang, Canrong Zhang:
Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines. 236-258 - Hamidreza Badri, Ehsan Salari, Yoichi Watanabe, Kevin Leder:
Optimizing Chemoradiotherapy to Target Metastatic Disease and Tumor Growth. 259-277 - Bing Wang, Jiaqiao Hu:
Some Monotonicity Results for Stochastic Kriging Metamodels in Sequential Settings. 278-294 - Kresimir Mihic, Kevin Ryan, Alan Wood:
Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study. 295-308 - Björn Geißler, Antonio Morsi, Lars Schewe, Martin Schmidt:
Solving Highly Detailed Gas Transport MINLPs: Block Separability and Penalty Alternating Direction Methods. 309-323 - Nathan Adelgren, Pietro Belotti, Akshay Gupte:
Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming. 324-338 - Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck:
Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation. 339-360 - Oliver Lum, Bruce L. Golden, Edward A. Wasil:
An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances. 361-370 - Osman Y. Özaltin, Oleg A. Prokopyev, Andrew J. Schaefer:
Optimal Design of the Seasonal Influenza Vaccine with Manufacturing Autonomy. 371-387 - Jikai Zou, Shabbir Ahmed, Xu Andy Sun:
Partially Adaptive Stochastic Optimization for Electric Power Generation Expansion Planning. 388-401 - Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl:
A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems. 402-420
Volume 30, Number 3, Summer 2018
- Allen Holder, Fred Murphy, William P. Pierskalla:
A Memorial to Harvey J. Greenberg, Founding Editor of the INFORMS Journal on Computing. 421-423
- Christoph Buchheim, Emiliano Traversi:
Quadratic Combinatorial Optimization Using Separable Underestimators. 424-437 - Mingzheng Wang, Zhengrui Jiang, Yu Zhang, Haifang Yang:
T-Closeness Slicing: A New Privacy-Preserving Approach for Transactional Data Publishing. 438-453 - Xueting Cui, Xiaoling Sun, Shushang Zhu, Rujun Jiang, Duan Li:
Portfolio Optimization with Nonparametric Value at Risk: A Block Coordinate Descent Method. 454-471 - Jamie Fairbrother, Amanda G. Turner, Stein W. Wallace:
Scenario Generation for Single-Period Portfolio Selection Problems with Tail Risk Measures: Coping with High Dimensions and Integer Variables. 472-491 - Huseyin Tunc, Onur A. Kilic, S. Armagan Tarim, Roberto Rossi:
An Extended Mixed-Integer Programming Formulation and Dynamic Cut Generation Approach for the Stochastic Lot-Sizing Problem. 492-506 - Amin Khademi, Burak Eksioglu:
Spare Parts Inventory Management with Substitution-Dependent Reliability. 507-521 - Igor Averbakh, Jordi Pereira:
Lateness Minimization in Pairwise Connectivity Restoration Problems. 522-538 - Renaud Chicoisne, Fernando Ordóñez, Daniel G. Espinoza:
Risk Averse Shortest Paths: A Computational Study. 539-553 - Claudio Gambella, Joe Naoum-Sawaya, Bissan Ghaddar:
The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches. 554-569 - Taghi Khaniyev, Samir Elhedhli, Fatih Safa Erenay:
Structure Detection in Mixed-Integer Programs. 570-587 - Ran Liu, Xiaolan Xie:
Physician Staffing for Emergency Departments with Time-Varying Demand. 588-607 - Iain Dunning, Swati Gupta, John Silberholz:
What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO. 608-624
Volume 30, Number 4, Fall 2018
- Tolga Bektas:
Disjunctive Programming for Multiobjective Discrete Optimisation. 625-633 - Yingda Song, Ning Cai, Steven Kou:
Computable Error Bounds of Laplace Inversion for Pricing Asian Options. 634-645 - Jean-François Côté, Manuel Iori:
The Meet-in-the-Middle Principle for Cutting and Packing Problems. 646-661 - Yuli Zhang, Zuo-Jun Max Shen, Shiji Song:
Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times. 662-676 - Qi Fan, Jiaqiao Hu:
Surrogate-Based Promising Area Search for Lipschitz Continuous Simulation Optimization. 677-693 - Ricardo Fukasawa, Qie He, Fernando Santos, Yongjia Song:
A Joint Vehicle Routing and Speed Optimization Problem. 694-709 - Alberto Ceselli, Maria Luisa Damiani, Giovanni Righini, Diego Valorsi:
Mathematical Programming Algorithms for Spatial Cloaking. 710-723 - Demet Batur, Lina Wang, F. Fred Choobineh:
Methods for System Selection Based on Sequential Mean-Variance Analysis. 724-738 - Ben Knueven, Jim Ostrowski, Jianhui Wang:
The Ramping Polytope and Cut Generation for the Unit Commitment Problem. 739-749 - Yan Li, Kristofer G. Reyes, Jorge Vazquez-Anderson, Yingfei Wang, Lydia M. Contreras, Warren B. Powell:
A Knowledge Gradient Policy for Sequencing Experiments to Identify the Structure of RNA Molecules Using a Sparse Additive Belief Model. 750-767 - Daniel Kowalczyk, Roel Leus:
A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching. 768-782
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-12-08 09:50 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:
