default search action
INFORMS Journal on Computing, Volume 24
Volume 24, Number 1, Winter 2012
- Jeff X. Yang, John H. Drew, Lawrence M. Leemis:
Automating Bivariate Transformations. 1-9 - William Kaczynski, Lawrence M. Leemis, John H. Drew:
Transient Queueing Analysis. 10-28 - Armann Ingolfsson
, Ling Tang:
Efficient and Reliable Computation of Birth-Death Process Performance Measures. 29-41 - Kaiqi Yu, Mei-Ling Huang, Percy H. Brill:
An Algorithm for Fitting Heavy-Tailed Distributions via Generalized Hyperexponentials. 42-52 - Ebru Angün
An Asymptotic Test of Optimality Conditions in Multiresponse Simulation Optimization. 53-65 - Roberto Rossi
Constraint-Based Local Search for Inventory Control Under Stochastic Demand and Lead Time. 66-80 - Stefano Gualandi
Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation. 81-100 - Claudia Archetti
A Hybrid Heuristic for an Inventory Routing Problem. 101-116 - Jong-Seok Lee
Shilling Attack Detection - A New Approach for a Trustworthy Recommender System. 117-131 - Sanjeeb Dash, Oktay Günlük
A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows. 132-147 - Daniel Adelman, Diego Klabjan:
Computing Near-Optimal Policies in Generalized Joint Replenishment. 148-164 - Pasquale Avella
Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable. 165-171 - Brian Keller, Güzin Bayraksan
Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints. 172-186
Volume 24, Number 2, Spring 2012
- Daniel Delling, Giacomo Nannicini:
Core Routing on Dynamic Time-Dependent Road Networks. 187-201 - Peter M. Hahn, Yi-Rong Zhu, Monique Guignard, William L. Hightower, Matthew J. Saltzman:
A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem. 202-209 - Michele Samorani
Data-Mining-Driven Neighborhood Search. 210-227 - Arnaud Malapert, Hadrien Cambazard, Christelle Guéret
An Optimal Constraint Programming Approach to the Open-Shop Problem. 228-244 - Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos
Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem. 245-259 - Mehmet C. Demirci, Andrew J. Schaefer
An Exact Method for Balancing Efficiency and Equity in the Liver Allocation Hierarchy. 260-275 - Daniele Catanzaro
The Balanced Minimum Evolution Problem. 276-294 - Soumyadip Ghosh, Raghu Pasupathy:
C-NORTA: A Rejection Procedure for Sampling from the Tail of Bivariate NORTA Distributions. 295-310 - Zan Huang, Akhil Kumar:
A Study of Quality and Accuracy Trade-offs in Process Mining. 311-327 - Jonathan Eckstein
An Improved Branch-and-Bound Method for Maximum Monomial Agreement. 328-341
Volume 24, Number 3, Summer 2012
- Gerardo Berbeglia
A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem. 343-355 - Roberto Baldacci
New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows. 356-371 - Yinghui (Catherine) Yang, Balaji Padmanabhan, Hongyan Liu, Xiaoyu Wang:
Discovery of Periodic Patterns in Sequence Data: A Variance-Based Approach. 372-386 - Mohammad M. Fazel-Zarandi, J. Christopher Beck:
Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem. 387-398 - Renata Mansini
CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem. 399-415 - Xue Bai, Ram D. Gopal
On the Prevention of Fraud and Privacy Exposure in Process Information Flow. 416-432 - Edward C. Sewell, Sheldon H. Jacobson
A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem. 433-442 - Xiangyong Li, Yash P. Aneja:
A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks. 443-456 - Sam D. Allen, Edmund K. Burke
Data Structures for Higher-Dimensional Rectilinear Packing. 457-470 - Gabriella Dellino
Robust Optimization in Simulation: Taguchi and Krige Combined. 471-484 - Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus
Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles. 485-499 - Simon A. Spacey
Robust Software Partitioning with Multiple Instantiation. 500-515
Volume 24, Number 4, Fall 2012
- John W. Chinneck:
From the Editor. 517
- Ehsan Salari, H. Edwin Romeijn:
Quantifying the Trade-off Between IMRT Treatment Plan Quality and Delivery Efficiency Using Direct Aperture Optimization. 518-533 - Bruce L. Golden, Zahra Naji Azimi
The Generalized Covering Salesman Problem. 534-553 - Nicolas Jozefowiez, Gilbert Laporte, Frédéric Semet
A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem. 554-564 - John Gunnar Carlsson:
Dividing a Territory Among Several Vehicles. 565-577 - Faramroze G. Engineer, George L. Nemhauser, Martin W. P. Savelsbergh
The Fixed-Charge Shortest-Path Problem. 578-596 - Simon Görtz, Andreas Klose
A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem. 597-610 - Milind Dawande
Structural Search and Optimization in Social Networks. 611-623 - Dashi I. Singham, Lee W. Schruben:
Finite-Sample Performance of Absolute Precision Stopping Rules. 624-635 - Lih-Yuan Deng, Jyh-Jen Horng Shiau, Henry Horng-Shing Lu:
Large-Order Multiple Recursive Generators with Modulus 231 - 1. 636-647 - Xue Bai:
A Mathematical Framework for Data Quality Management in Enterprise Systems. 648-664 - Warren B. Powell, Abraham P. George, Hugo P. Simão, Warren R. Scott, Alan Lamont, Jeffrey Stewart:
SMART: A Stochastic Multiscale Model for the Analysis of Energy Resources, Technology, and Policy. 665-682
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-01-02 18:01 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: