default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDINFORMS Journal on Computing, Volume 27
Volume 27, Number 1, Winter 2015
- Eduardo Álvarez-Miranda
, Ivana Ljubic, S. Raghavan, Paolo Toth:
The Recoverable Robust Two-Level Network Design Problem. 1-19 - Haibing Lu, Jaideep Vaidya, Vijayalakshmi Atluri, Yingjiu Li:
Statistical Database Auditing Without Query Denial Threat. 20-34 - Chun-An Chou, Zhe Liang, Wanpracha Art Chaovalitwongse, Tanya Y. Berger-Wolf, Bhaskar DasGupta, Saad I. Sheikh, Mary V. Ashley, Isabel C. Caballero:
Column-Generation Framework of Nonlinear Similarity Model for Reconstructing Sibling Groups. 35-47 - Masoud Yaghini, Mohammad Karimi, Mohadeseh Rahbar, Mohammad Hassan Sharifitabar:
A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem. 48-58 - Francisco Trespalacios, Ignacio E. Grossmann:
Algorithmic Approach for Improved Mixed-Integer Reformulations of Convex Generalized Disjunctive Programs. 59-74 - Edwin R. van Dam, Renata Sotirov:
On Bounding the Bandwidth of Graphs with Symmetry. 75-88 - Giovanni Pantuso, Kjetil Fagerholt, Stein W. Wallace:
Solving Hierarchical Stochastic Programs: Application to the Maritime Fleet Renewal Problem. 89-102 - Andrei Sleptchenko, M. Eric Johnson:
Maintaining Secure and Reliable Distributed Control Systems. 103-117 - Markus Leitner, Ivana Ljubic, Markus Sinnl:
A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem. 118-134 - Halil Sen, Kerem Bülbül:
A Strong Preemptive Relaxation for Weighted Tardiness and Earliness/Tardiness Problems on Unrelated Parallel Machines. 135-150 - Wolfgang Steitz:
New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem. 151-163 - Anurag Verma, Austin Buchanan, Sergiy Butenko:
Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks. 164-177 - Austin Buchanan, Je Sang Sung, Sergiy Butenko, Eduardo L. Pasiliao:
An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets. 178-188
- Matthew J. Saltzman:
Book Reviews. 189-192
Volume 27, Number 2, Spring 2015
- Jin Wang, Michael R. Taaffe:
Multivariate Mixtures of Normal Distributions: Properties, Random Vector Generation, Fitting, and as Models of Market Daily Changes. 193-203 - Si Chen, Ivana Ljubic, S. Raghavan:
The Generalized Regenerator Location Problem. 204-220 - Zhang-Hua Fu, Jin-Kao Hao:
Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints. 221-237 - Miles Lubin, Iain Dunning:
Computing in Operations Research Using Julia. 238-248 - Chungmok Lee, Minh Pham, Myong Kee Jeong, Dohyun Kim, Dennis K. J. Lin, Wanpracha Art Chaovalitwongse:
A Network Structural Approach to the Link Prediction Problem. 249-267 - Diarmuid Grimes, Emmanuel Hebrard:
Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search. 268-284 - Yanwu Yang, Daniel Zeng, Yinghui Yang, Jie Zhang:
Optimal Budget Allocation Across Search Advertising Markets. 285-300 - Siqian Shen, Murat Kurt, Jue Wang:
Chance-Constrained Programming Models and Approximations for General Stochastic Bottleneck Spanning Tree Problems. 301-316 - L. Jeff Hong, Jun Luo, Barry L. Nelson:
Chance Constrained Selection of the Best. 317-334 - W. Zachary Rayfield, Paat Rusmevichientong, Huseyin Topaloglu:
Approximation Methods for Pricing Problems Under the Nested Logit Model with Price Bounds. 335-357 - Panos Parpas, Berk Ustun, Mort Webster, Quang Kha Tran:
Importance Sampling in Stochastic Programming: A Markov Chain Monte Carlo Approach. 358-377 - Etienne de Klerk, Renata Sotirov, Uwe Truetsch:
A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives. 378-391 - Fabio Furini, Manuel Iori, Silvano Martello, Mutsunori Yagiura:
Heuristic and Exact Algorithms for the Interval Min-Max Regret Knapsack Problem. 392-405 - Radislav Vaisman, Ofer Strichman, Ilya B. Gertsbakh:
Model Counting of Monotone Conjunctive Normal Form Formulas with Spectra. 406-415 - Maciej Rysz, Alexander Vinel, Pavlo A. Krokhmal, Eduardo L. Pasiliao:
A Scenario Decomposition Algorithm for Stochastic Programming Problems with a Class of Downside Risk Measures. 416-430
Volume 27, Number 3, Summer 2015
- Silvio Alexandre de Araujo, Bert De Reyck, Zeger Degraeve, Ioannis Fragkos, Raf Jans:
Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times. 431-448 - Mihai Bilauca, Graeme Gange, Patrick Healy, Kim Marriott, Peter Moulder, Peter J. Stuckey:
Automatic Minimal-Height Table Layout. 449-461 - Debabrata Dey, Atanu Lahiri, Guoying Zhang:
Optimal Policies for Security Patch Management. 462-477 - Karl Bringmann, Benjamin Doerr, Adrian Neumann, Jakub Sliacan:
Online Checkpointing with Improved Worst-Case Guarantees. 478-490 - Ohad Perry, Ward Whitt:
Achieving Rapid Recovery in an Overload Control for Large-Scale Service Systems. 491-506 - Artur Alves Pessoa, Michael Poss:
Robust Network Design with Uncertain Outsourcing Cost. 507-524 - Daniel R. Jiang, Warren B. Powell:
Optimal Hour-Ahead Bidding in the Real-Time Electricity Market with Battery Storage Using Approximate Dynamic Programming. 525-543 - Willem van Jaarsveld, Alan Scheller-Wolf:
Optimization of Industrial-Scale Assemble-to-Order Systems. 544-560 - Raymond Y. K. Lau, J. Leon Zhao, Wenping Zhang, Yi Cai, Eric W. T. Ngai:
Learning Context-Sensitive Domain Ontologies from Folksonomies: A Cognitively Motivated Method. 561-578
Volume 27, Number 4, Fall 2015
- Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh:
A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method. 597-618 - Xue Bai, Sudip Bhattacharjee, Fidan Boylu, Ram D. Gopal:
Growth Projections and Assortment Planning of Commodity Products Across Multiple Stores: A Data Mining and Optimization Approach. 619-635 - Zhou Xu, Brian Rodrigues:
A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots. 636-645 - Andrew Ahn, Martin B. Haugh:
Linear Programming and the Control of Diffusion Processes. 646-657 - Rafael Martinelli, Claudio Contardo:
Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure. 658-676 - Adolfo R. Escobedo, Erick Moreno-Centeno:
Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations. 677-689 - Gilles Pesant:
Achieving Domain Consistency and Counting Solutions for Dispersion Constraints. 690-703 - Jiangchuan Huang, Christoph M. Kirsch, Raja Sengupta:
Cloud Computing in Space. 704-717 - Daniel Gartner, Rainer Kolisch, Daniel B. Neill, Rema Padman:
Machine Learning Approaches for Early DRG Classification and Resource Allocation. 718-734 - Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh:
A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method. 735-754 - Serhat Gul, Brian T. Denton, John W. Fowler:
A Progressive Hedging Approach for Surgery Planning Under Uncertainty. 755-772 - Jérémy Omer, Samuel Rosat, Vincent Raymond, François Soumis:
Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis. 773-787 - Thomas Bortfeld, Jagdish Ramakrishnan, John N. Tsitsiklis, Jan Unkelbach:
Optimization of Radiation Therapy Fractionation Schedules in the Presence of Tumor Repopulation. 788-803
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-05 22:39 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:
