default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDINFORMS Journal on Computing, Volume 32
Volume 32, Number 1, Winter 2020
- Alice E. Smith
:
Note from the Editor. 1-2
- Gerdus Benadè, John N. Hooker:
Optimization Bounds from the Branching Dual. 3-15 - Tyler A. Perini, Natashia Boland, Diego Pecin, Martin W. P. Savelsbergh:
A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method. 16-39 - Wei Xia, Juan-Carlos Vera, Luis F. Zuluaga:
Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques. 40-56 - Daniel Jornada, V. Jorge Leon:
Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint. 57-73 - Qinghua Wu, Yang Wang, Fred W. Glover:
Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking. 74-89 - Daniel Oliveira, Artur Alves Pessoa:
An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems. 90-100 - Maxence Delorme, Manuel Iori:
Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems. 101-119 - Okan Arslan, Ola Jabali, Gilbert Laporte:
A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints. 120-134 - Pierre L'Ecuyer, Paul Wambergue, Erwan Bourceret:
Spectral Analysis of the MIXMAX Random Number Generators. 135-144 - Ilke Bakir, Natashia Boland, Brian C. Dandurand, Alan L. Erera:
Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs. 145-163 - Jietao Xie, Juan Wu:
Recursive Calculation Model for a Special Multivariate Normal Probability of First-Order Stationary Sequence. 164-171 - Yves Mocquard, Bruno Sericola, Emmanuelle Anceaume:
Probabilistic Analysis of Rumor-Spreading Time. 172-181 - Daehan Won, Hasan Manzour, Wanpracha Art Chaovalitwongse:
Convex Optimization for Group Feature Selection in Networked Data. 182-198
Volume 32, Number 2, Spring 2020
- Alice E. Smith:
Note from the Editor. 199-200
- Areesh Mittal, Can Gokalp, Grani A. Hanasusanto:
Robust Quadratic Programming with Mixed-Integer Uncertainty. 201-218 - Hao Hu, Renata Sotirov:
On Solving the Quadratic Shortest Path Problem. 219-233 - Sepehr Nemati, Zeynep G. Icten, Lisa M. Maillart, Andrew J. Schaefer:
Mitigating Information Asymmetry in Liver Allocation. 234-248 - Stefan Poikonen, Bruce L. Golden:
The Mothership and Drone Routing Problem. 249-262 - Margarita P. Castro, André Augusto Ciré, J. Christopher Beck:
An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP. 263-278 - Gerald G. Brown, W. Matthew Carlyle:
Solving the Nearly Symmetric All-Pairs Shortest-Path Problem. 279-288 - Dilek Günneç, S. Raghavan, Rui Zhang:
Least-Cost Influence Maximization on Social Networks. 289-302 - Xiaoye Cheng, Jingjing Zhang, Lu Lucy Yan:
Understanding the Impact of Individual Users' Rating Characteristics on the Predictive Accuracy of Recommender Systems. 303-320 - Zhiling Guo, Jin Li, Ram Ramesh:
Scalable, Adaptable, and Fast Estimation of Transient Downtime in Virtual Infrastructures Using Convex Decomposition and Sample Path Randomization. 321-345 - Alper Atamtürk, Carlos Deck, Hyemin Jeon:
Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction. 346-355 - Guangxin Jiang, L. Jeff Hong, Barry L. Nelson:
Online Risk Monitoring Using Offline Simulation. 356-375 - Nanjing Jian, Shane G. Henderson:
Estimating the Probability that a Function Observed with Noise Is Convex. 376-389 - Zhenyu Cui, Michael C. Fu, Jian-Qiang Hu, Yanchu Liu, Yijie Peng, Lingjiong Zhu:
On the Variance of Single-Run Unbiased Stochastic Derivative Estimators. 390-407 - Dimitris Bertsimas, Iain Dunning:
Relative Robust and Adaptive Optimization. 408-427 - Lijun Wei, Zhixing Luo, Roberto Baldacci, Andrew Lim:
A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems. 428-443 - Raphael Kramer, Manuel Iori, Thibaut Vidal:
Mathematical Models and Search Algorithms for the Capacitated -Center Problem. 444-460 - William Pettersson, Melih Ozlen:
Multiobjective Integer Programming: Synergistic Parallel Approaches. 461-472 - Tobias Achterberg, Robert E. Bixby, Zonghao Gu, Edward Rothberg, Dieter Weninger:
Presolve Reductions in Mixed Integer Programming. 473-506 - Steffen Rebennack, Vitaliy Krasko:
Piecewise Linear Function Fitting via Mixed-Integer Linear Programming. 507-530
Volume 32, Number 3, Summer 2020
- Lingxun Kong, Christos T. Maravelias:
On the Derivation of Continuous Piecewise Linear Approximating Functions. 531-546 - Zheng Zhang, Brian T. Denton, Xiaolan Xie:
Branch and Price for Chance-Constrained Bin Packing. 547-564 - Joshua Q. Hale, Helin Zhu, Enlu Zhou:
Domination Measure: A New Metric for Solving Multiobjective Optimization. 565-581 - Samuel Deleplanque, Martine Labbé, Diego Ponce, Justo Puerto:
A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem. 582-599 - Young Woong Park:
MILP Models for Complex System Reliability Redundancy Allocation with Mixed Components. 600-619 - Shuming Wang, Yan-Fu Li:
Distributionally Robust Design for Redundancy Allocation. 620-640 - Hoda Atef Yekta, Robert Day:
Optimization-based Mechanisms for the Course Allocation Problem. 641-660 - Anirudh Subramanyam, Panagiotis P. Repoussis, Chrysanthos E. Gounaris:
Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty. 661-681 - Ksenia Bestuzheva, Hassan L. Hijazi, Carleton Coffrin:
Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching. 682-696 - Shixuan Zhang, Sheng Liu, Tianhu Deng, Zuo-Jun Max Shen:
Transient-State Natural Gas Transmission in Gunbarrel Pipeline Networks. 697-713 - Fan Zhou, Kunpeng Zhang, Shuying Xie, Xucheng Luo:
Learning to Correlate Accounts Across Online Social Networks: An Embedding-Based Approach. 714-729 - Vladyslav Sokol, Ante Custic, Abraham P. Punnen, Binay Bhattacharya:
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms. 730-746 - Seyedmohammadhossein Hosseinian, Dalila B. M. M. Fontes, Sergiy Butenko:
A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem. 747-762 - Zhuqi Miao, Balabhaskar Balasundaram:
An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph. 763-778 - Yaqin Zhou, Shaojie Tang:
Differentially Private Distributed Learning. 779-789 - Kai Han, Yuntian He, Alex X. Liu, Shaojie Tang, He Huang:
Differentially Private and Budget-Limited Bandit Learning over Matroids. 790-804 - Kevin Ryan, Shabbir Ahmed, Santanu S. Dey, Deepak Rajan, Amelia Musselman, Jean-Paul Watson:
Optimization-Driven Scenario Grouping. 805-821 - Egon Balas, Thiago Serra:
When Lift-and-Project Cuts Are Different. 822-834 - Nan Liu, Yuhang Ma, Huseyin Topaloglu:
Assortment Optimization Under the Multinomial Logit Model with Sequential Offerings. 835-853
Volume 32, Number 4, Fall 2020
- Alice E. Smith:
Note from the Editor. 855-856
- Bernard Knueven, James Ostrowski, Jean-Paul Watson:
On Mixed-Integer Programming Formulations for the Unit Commitment Problem. 857-876 - Vishal Ahuja, John R. Birge:
An Approximation Approach for Response-Adaptive Clinical Trial Design. 877-894 - Hrayer Aprahamian, Douglas R. Bish, Ebru K. Bish:
Optimal Group Testing: Structural Properties and Robust Solutions, with Application to Public Health Screening. 895-911 - Sean L. Barnes, Miranda Myers, Clare Rock, Daniel J. Morgan, Lisa Pineles, Kerri A. Thom, Anthony D. Harris:
Evaluating a Prediction-Driven Targeting Strategy for Reducing the Transmission of Multidrug-Resistant Organisms. 912-929 - Ali Ajdari, Fatemeh Saberian, Archis Ghate:
A Theoretical Framework for Learning Tumor Dose-Response Uncertainty in Individualized Spatiobiologically Integrated Radiotherapy. 930-951 - Hamidreza Validi, Austin Buchanan:
The Optimal Design of Low-Latency Virtual Backbones. 952-967 - Geunyeong Byeon, Pascal Van Hentenryck, Russell Bent, Harsha Nagarajan:
Communication-Constrained Expansion Planning for Resilient Distribution Systems. 968-985 - Zdravko I. Botev, Pierre L'Ecuyer:
Sampling Conditionally on a Rare Event via Generalized Splitting. 986-995 - Qiudan Li, Daniel Dajun Zeng, David Jingjun Xu, Ruoran Liu, Riheng Yao:
Understanding and Predicting Users' Rating Behavior: A Cognitive Perspective. 996-1011 - Feng Li, Zhou Xu, Zhi-Long Chen:
Production and Transportation Integration for Commit-to-Delivery Mode with General Shipping Costs. 1012-1029 - Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli, Bruce L. Golden:
An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem. 1030-1048 - Maurizio Boccia, Antonio Sforza, Claudio Sterle:
Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches. 1049-1060 - Renata Mansini, Roberto Zanotti:
A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem. 1061-1079 - Kyle Cooper, Susan R. Hunter, Kalyani Nagaraj:
Biobjective Simulation Optimization on Integer Lattices Using the Epsilon-Constraint Method in a Retrospective Approximation Framework. 1080-1100 - Kyle Cooper, Susan R. Hunter:
PyMOSO: Software for Multiobjective Simulation Optimization with R-PERLE and R-MinRLE. 1101-1108 - Ernst Roos, Dick den Hertog:
Reducing Conservatism in Robust Optimization. 1109-1127 - Bo Zeng:
A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem. 1128-1142 - Juheng Zhang, Xiaoping Liu, Xiao-Bai Li:
Predictive Analytics with Strategically Missing Data. 1143-1156 - Nir Halman:
Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs. 1157-1181
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-19 01:18 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:
