default search action
INFORMS Journal on Computing, Volume 26
Volume 26, Number 1, Winter 2014
- Oya Ekin Karasan, Ali Ridha Mahjoub, Onur Özkök, Hande Yaman
:
Survivability in Hierarchical Telecommunications Networks Under Dual Homing. 1-15 - Renata Sotirov
An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem. 16-30 - Hassan L. Hijazi
An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs. 31-44 - Yan T. Yang, Barak Fishbain, Dorit S. Hochbaum, Eric B. Norman, Erik Swanberg:
The Supervised Normalized Cut Method for Detecting, Classifying, and Identifying Special Nuclear Materials. 45-58 - Yunan Liu
Algorithms for Time-Varying Networks of Many-Server Fluid Queues. 59-73 - Russell R. Barton
Quantifying Input Uncertainty via Simulation Confidence Intervals. 74-87 - Claudio Contardo
An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem. 88-102 - Yossiri Adulyasak
Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems. 103-120 - Chaoxu Tong, Huseyin Topaloglu:
On the Approximate Linear Programming Approach for Network Revenue Management Problems. 121-134 - Jia Shu, Miao Song
Dynamic Container Deployment: Two-Stage Robust Model, Complexity, and Computational Results. 135-149 - Woonghee Tim Huh, Paat Rusmevichientong:
Online Sequential Optimization with Biased Gradients: Theory and Applications to Censored Demand. 150-159 - Onur Seref, Ya-Ju Fan, Wanpracha Art Chaovalitwongse:
Mathematical Programming Formulations and Algorithms for Discrete k-Median Clustering of Time-Series Data. 160-172 - Franklin Djeumou Fomeni, Adam N. Letchford
A Dynamic Programming Heuristic for the Quadratic Knapsack Problem. 173-182 - Matthew J. Robbins
The Weighted Set Covering Game: A Vaccine Pricing Model for Pediatric Immunization. 183-198
Volume 26, Number 2, Spring 2014
- Guilherme Kunigami, Pedro J. de Rezende, Cid C. de Souza
Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation. 199-207 - Hongyan Liu, Yinghui (Catherine) Yang, Zhuohua Chen, Yong Zheng:
A Tree-Based Contrast Set-Mining Approach to Detecting Group Differences. 208-221 - Santanu S. Dey
On the Practical Strength of Two-Row Tableau Cuts. 222-237 - Hung-Pin Kao, Kwei Tang
Cost-Sensitive Decision Tree Induction with Label-Dependent Late Constraints. 238-252 - David Bergman, André A. Ciré, Willem Jan van Hoeve, John N. Hooker:
Optimization Bounds from Binary Decision Diagrams. 253-268 - Athanassios N. Avramidis
Constructing Discrete Unbounded Distributions with Gaussian-Copula Dependence and Given Rank Correlation. 269-279 - John Gunnar Carlsson, Fan Jia, Ying Li:
An Approximation Algorithm for the Continuous k-Medians Problem in a Convex Polygon. 280-289 - Chase Rainwater, Joseph Geunes, H. Edwin Romeijn:
Resource-Constrained Assignment Problems with Shared Resource Consumption and Flexible Demand. 290-302 - Volkan Yazici, Cevdet Aykanat:
Constrained Min-Cut Replication for K-Way Hypergraph Partitioning. 303-320 - Mohammad Javad Feizollahi, Igor Averbakh:
The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows. 321-335 - Amitabh Basu
On Chubanov's Method for Linear Programming. 336-350 - Gediminas Adomavicius, YoungOk Kwon:
Optimization-Based Approaches for Maximizing Aggregate Recommendation Diversity. 351-369 - Vural Aksakalli, Ibrahim Ari
Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem. 370-384 - L. Jeff Hong
Conditional Value-at-Risk Approximation to Value-at-Risk Constrained Programs: A Remedy via Monte Carlo. 385-400 - Kalyan T. Talluri:
New Formulations for Choice Network Revenue Management. 401-413
Volume 26, Number 3, Summer 2014
- Behnam Behdani, J. Cole Smith
An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem. 415-432 - Abhijeet Ghoshal, Sumit Sarkar
Association Rules for Recommendations with Multiple Items. 433-448 - Pierre L'Ecuyer
On the Lattice Structure of a Special Class of Multiple Recursive Random Number Generators. 449-460 - Kaiquan Xu, Stephen Shaoyi Liao
Effective Active Learning Strategies for the Use of Large-Margin Classifiers in Semantic Annotation: An Optimal Parameter Discovery Perspective. 461-483 - Michael C. Fu, Huashuai Qu:
Regression Models Augmented with Direct Stochastic Gradient Estimators. 484-499 - Huseyin Onur Mete, Zelda B. Zabinsky:
Multiobjective Interacting Particle Algorithm for Global Optimization. 500-513 - Ahmed Ghoniem
Enhanced Models for a Mixed Arrival-Departure Aircraft Sequencing Problem. 514-530 - Feng Qiu
Covering Linear Programming with Violations. 531-546 - Jason J. Sauppe, Sheldon H. Jacobson
Complexity and Approximation Results for the Balance Optimization Subset Selection Model for Causal Inference in Observational Studies. 547-566 - J. Paul Brooks, Eva K. Lee:
Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model. 567-585 - Fang Fang, Kaushik Dutta, Anindya Datta:
Domain Adaptation for Sentiment Classification in Light of Multiple Sources. 586-598 - Anahita Khojandi, Lisa M. Maillart
Optimal Implantable Cardioverter Defibrillator (ICD) Generator Replacement. 599-615 - Eunji Lim:
On Convergence Rates of Convex Regression in Multiple Dimensions. 616-628 - Supreet Reddy Mandala, Soundar R. T. Kumara, Kalyan Chatterjee:
A Game-Theoretic Approach to Graph Clustering. 629-643
Volume 26, Number 4, Fall 2014
- Bernard Gendron, Abilio Lucena
Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem. 645-657 - Michelle L. Blom
A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines. 658-676 - Yongxi Cheng, Ding-Zhu Du, Yinfeng Xu:
A Zig-Zag Approach for Competitive Group Testing. 677-689 - Xiaojin Zheng, Xiaoling Sun, Duan Li
Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach. 690-703 - David R. Morrison, Jason J. Sauppe, Edward C. Sewell, Sheldon H. Jacobson
A Wide Branching Strategy for the Graph Coloring Problem. 704-717 - Carleton Coffrin, Pascal Van Hentenryck:
A Linear-Programming Approximation of AC Power Flows. 718-734 - Yongjia Song, James R. Luedtke, Simge Küçükyavuz:
Chance-Constrained Binary Packing Problems. 735-747 - Forbes J. Burkowski, Yuen-Lam Cheung, Henry Wolkowicz:
Efficient Use of Semidefinite Programming for Selection of Rotamers in Protein Conformations. 748-766 - Esra Koca
Lot Sizing with Piecewise Concave Production Costs. 767-779 - Sanjeeb Dash, Oktay Günlük
Computational Experiments with Cross and Crooked Cross Cuts. 780-797 - Yifei Zhao, Stein W. Wallace:
Integrated Facility Layout Design and Flow Assignment Problem Under Uncertainty. 798-808 - Alexander Butsch, Jörg Kalcsics
Districting for Arc Routing. 809-824 - Dimitri J. Papageorgiou, Ahmet B. Keha, George L. Nemhauser, Joel S. Sokol
Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing. 825-847 - L. Jeff Hong
Estimating Sensitivities of Portfolio Credit Risk Using Monte Carlo. 848-865 - Hao Xia, Milind Dawande
Role Refinement in Access Control: Model and Analysis. 866-884 - Brent Fisher, Mohan L. Chaudhry:
Computing the Distribution for the Number of Renewals with Bulk Arrivals. 885-892 - Grit Claßen, Arie M. C. A. Koster
Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks. 893-909
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-02 20:32 CEST 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: