INFORMS Journal on Computing, Volume 31 (original) (raw)

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches
• 

Venues:

• no matches
• 

Publications:

• no matches
• 

• > Home > Journals > INFORMS Journal on Computing

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

Volume 31, Number 1, Winter 2019

Message from the Editor

• 
  • 
  • 
  • 
  • 
    Alice E. Smith:
    Message from the Editor. 1

Research Articles

• 
  • 
  • 
  • 
  • 
    Zhen Sun, Milind Dawande, Ganesh Janakiraman, Vijay S. Mookerjee:
    Data-Driven Decisions for Problems with an Unspecified Objective Function. 2-20
• 
  • 
  • 
  • 
  • 
    Liujia Hu, Sigrún Andradóttir:
    An Asymptotically Optimal Set Approach for Simulation Optimization. 21-39
• 
  • 
  • 
  • 
  • 
    Terrence W. K. Mak, Pascal Van Hentenryck, Anatoly Zlotnik, Russell Bent:
    Dynamic Compressor Optimization in Natural Gas Pipeline Systems. 40-65
• 
  • 
  • 
  • 
  • 
    Shalinda Adikari, Kaushik Dutta:
    A New Approach to Real-Time Bidding in Online Advertisements: Auto Pricing Strategy. 66-82
• 
  • 
  • 
  • 
  • 
    Mika Sumida, Huseyin Topaloglu:
    An Approximation Algorithm for Capacity Allocation Over a Single Flight Leg with Fare-Locking. 83-99
• 
  • 
  • 
  • 
  • 
    Marleen Balvert, Dick den Hertog, Aswin L. Hoffmann:
    Robust Optimization of Dose-Volume Metrics for Prostate HDR-Brachytherapy Incorporating Target and OAR Volume Delineation Uncertainties. 100-114
• 
  • 
  • 
  • 
  • 
    Aritra Pal, Hadi Charkhgard:
    A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming. 115-133
• 
  • 
  • 
  • 
  • 
    Masoud Chitsaz, Jean-François Cordeau, Raf Jans:
    A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing. 134-152
• 
  • 
  • 
  • 
  • 
    Xin Wang, Teodor Gabriel Crainic, Stein W. Wallace:
    Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions. 153-170
• 
  • 
  • 
  • 
  • 
    Markus Leitner, Ivana Ljubic, Martin Riedler, Mario Ruthmair:
    Exact Approaches for Network Design Problems with Relays. 171-192

Volume 31, Number 2, Spring 2019

Research Articles

• 
  • 
  • 
  • 
  • 
    Bowen Du, Wenjun Zhou, Chuanren Liu, Yifeng Cui, Hui Xiong:
    Transit Pattern Detection Using Tensor Factorization. 193-206
• 
  • 
  • 
  • 
  • 
    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:
    Performance Comparison of Machine Learning Platforms. 207-225
• 
  • 
  • 
  • 
  • 
    Hao-Chun Lu, Liming Yao:
    Efficient Convexification Strategy for Generalized Geometric Programming Problems. 226-234
• 
  • 
  • 
  • 
  • 
    Jun Pei, Zorica Drazic, Milan Drazic, Nenad Mladenovic, Panos M. Pardalos:
    Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations. 235-250
• 
  • 
  • 
  • 
  • 
    Ruslan Sadykov, François Vanderbeck, Artur Alves Pessoa, Issam Tahiri, Eduardo Uchoa:
    Primal Heuristics for Branch and Price: The Assets of Diving Methods. 251-267
• 
  • 
  • 
  • 
  • 
    Yogesh Kumar Agarwal, Prahalad Venkateshan:
    New Valid Inequalities for the Optimal Communication Spanning Tree Problem. 268-284
• 
  • 
  • 
  • 
  • 
    Christian Tjandraatmadja, Willem-Jan van Hoeve:
    Target Cuts from Relaxed Decision Diagrams. 285-301
• 
  • 
  • 
  • 
  • 
    Ilbin Lee, Stewart Curry, Nicoleta Serban:
    Solving Large Batches of Linear Programs. 302-317
• 
  • 
  • 
  • 
  • 
    Manish Aggarwal, Ali Fallah Tehrani:
    Modelling Human Decision Behaviour with Preference Learning. 318-334
• 
  • 
  • 
  • 
  • 
    Stefan Poikonen, Bruce L. Golden, Edward A. Wasil:
    A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone. 335-346
• 
  • 
  • 
  • 
  • 
    Ran Liu, Michael E. Kuhl, Yunan Liu, James R. Wilson:
    Modeling and Simulation of Nonstationary Non-Poisson Arrival Processes. 347-366
• 
  • 
  • 
  • 
  • 
    Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao:
    Finding Critical Links for Closeness Centrality. 367-389
• 
  • 
  • 
  • 
  • 
    Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl:
    Interdiction Games and Monotonicity, with Application to Knapsack Problems. 390-410

Volume 31, Number 3, Summer 2019

Note from the Editor

• 
  • 
  • 
  • 
  • 
    Alice E. Smith:
    Note from the Editor. 411-412

Research Articles

• 
  • 
  • 
  • 
  • 
    Ward Passchyn, Dirk Briskorn, Frits C. R. Spieksma:
    No-Wait Scheduling for Locks. 413-428
• 
  • 
  • 
  • 
  • 
    Thierry Petit, Andrew C. Trapp:
    Enriching Solutions to Combinatorial Problems via Solution Engineering. 429-444
• 
  • 
  • 
  • 
  • 
    Dimitris Bertsimas, Omid Nohadani:
    Robust Maximum Likelihood Estimation. 445-458
• 
  • 
  • 
  • 
  • 
    Andrew C. Trapp, Wen Liu, Soussan Djamasbi:
    Identifying Fixations in Gaze Data via Inner Density and Optimization. 459-476
• 
  • 
  • 
  • 
  • 
    David Bergman:
    An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating. 477-492
• 
  • 
  • 
  • 
  • 
    Lixin Tang, Feng Li, Zhi-Long Chen:
    Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms. 493-514
• 
  • 
  • 
  • 
  • 
    Wu-Lin Chen:
    Computing the Moments of Polling Models with Batch Poisson Arrivals by Transform Inversion. 515-526
• 
  • 
  • 
  • 
  • 
    Ian Herszterg, Marcus Poggi, Thibaut Vidal:
    Two-Dimensional Phase Unwrapping via Balanced Spanning Forests. 527-543
• 
  • 
  • 
  • 
  • 
    Baris Ungun, Lei Xing, Stephen P. Boyd:
    Real-Time Radiation Treatment Planning with Optimality Guarantees via Cluster and Bound Methods. 544-558
• 
  • 
  • 
  • 
  • 
    Yan Deng, Siqian Shen, Brian T. Denton:
    Chance-Constrained Surgery Planning Under Conditions of Limited and Ambiguous Data. 559-575
• 
  • 
  • 
  • 
  • 
    Yujing Lin, Barry L. Nelson, Linda Pei:
    Virtual Statistics in Simulation via k Nearest Neighbors. 576-592
• 
  • 
  • 
  • 
  • 
    Tianhu Deng, Yong Liang, Shixuan Zhang, Jingze Ren, Shuyi Zheng:
    A Dynamic Programming Approach to Power Consumption Minimization in Gunbarrel Natural Gas Networks with Nonidentical Compressor Units. 593-611
• 
  • 
  • 
  • 
  • 
    Ricardo Fukasawa, Laurent Poirrier:
    Permutations in the Factorization of Simplex Bases. 612-632

Volume 31, Number 4, Fall 2019

In Memoriam

• 
  • 
  • 
  • 
  • 
    J. Cole Smith:
    In Memoriam: Shabbir Ahmed (1969-2019). 633-635

Research Articles

• 
  • 
  • 
  • 
  • 
    Michelle L. Blom, Peter J. Stuckey, Vanessa J. Teague:
    Toward Computing the Margin of Victory in Single Transferable Vote Elections. 636-653
• 
  • 
  • 
  • 
  • 
    Zhaoxia Guo, Stein W. Wallace, Michal Kaut:
    Vehicle Routing with Space- and Time-Correlated Stochastic Travel Times: Evaluating the Objective Function. 654-670
• 
  • 
  • 
  • 
  • 
    Louiqa Raschid, Hassan Sayyadi, Vagelis Hristidis:
    Learning to Rank in Entity Relationship Graphs. 671-688
• 
  • 
  • 
  • 
  • 
    Juliane Müller, Marcus Day:
    Surrogate Optimization of Computationally Expensive Black-Box Problems with Hidden Constraints. 689-702
• 
  • 
  • 
  • 
  • 
    Chrysafis Vogiatzis, Mustafa Can Camur:
    Identification of Essential Proteins Using Induced Stars in Protein-Protein Interaction Networks. 703-718
• 
  • 
  • 
  • 
  • 
    Abderrahmane Abbou, Viliam Makis:
    Group Maintenance: A Restless Bandits Approach. 719-731
• 
  • 
  • 
  • 
  • 
    Andreas Fügener, Jens O. Brunner:
    Planning for Overtime: The Value of Shift Extensions in Physician Scheduling. 732-744
• 
  • 
  • 
  • 
  • 
    Wen Shi, Xi Chen, Jennifer Shang:
    An Efficient Morris Method-Based Framework for Simulation Factor Screening. 745-770
• 
  • 
  • 
  • 
  • 
    Ketan Date, Rakesh Nagi:
    Level 2 Reformulation Linearization Technique-Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters. 771-789
• 
  • 
  • 
  • 
  • 
    Sune Lauth Gadegaard, Lars Relund Nielsen, Matthias Ehrgott:
    Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets. 790-804
• 
  • 
  • 
  • 
  • 
    Sophie N. Parragh, Fabien Tricoire:
    Branch-and-Bound for Bi-objective Integer Programming. 805-822
• 
  • 
  • 
  • 
  • 
    Alvaro Sierra-Altamiranda, Hadi Charkhgard:
    A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs. 823-840

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.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

dblp was originally created in 1993 at:

since 2018, dblp has been operated and maintained by: