default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDINFORMS Journal on Computing, Volume 13
Volume 13, Number 1, 2001
- W. David Kelton:
From the Editor. 1 - Ram D. Gopal
, Ram Ramesh, Stanley Zionts:
Cascade Graphs: Design, Analysis and Algorithms for Relational Joins. 2-28 - Joel A. Shapiro, Warren B. Powell, David Bernstein:
A Flexible Java Representation for Uncertainty in Online Operations-Research Models. 29-55 - Egon Balas, Neil Simonetti:
Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study. 56-75 - Michael O. Ball, Andrew Vakhutinsky:
Fault-Tolerant Virtual Path Layout in ATM Networks. 76-94
Volume 13, Number 2, 2001
- H. Paul Williams, Hong Yan:
Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming. 96-103 - Dorit S. Hochbaum, Eli V. Olinick:
The Bounded Cycle-Cover Problem. 104-119 - Celia A. Glass, Chris N. Potts, Vitaly A. Strusevich:
Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops. 120-137 - Michiel Blom, Sven Oliver Krumke, Willem de Paepe, Leen Stougie:
The Online TSP Against Fair Adversaries. 138-148 - Christos Alexopoulos, David Goldsman, Gamze Tokol:
Properties of Batched Quadratic-Form Variance Parameter Estimators for Simulations. 149-156 - Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger:
Non-Approximability Results for Scheduling Problems with Minsum Criteria. 157-168 - Csaba Mészáros, Jacek Gondzio:
Addendum to "Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method". 169-170
Volume 13, Number 3, 2001
- W. David Kelton:
From the Editor. 171 - Mohan L. Chaudhry, Umesh Chandra Gupta, Veena Goswami:
Modeling and Analysis of Discrete-Time Multiserver Queues with Batch Arrivals: GIX/Geom/m. 172-180 - Jeffery L. Kennington, Mark W. Lewis:
The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis. 181-190 - Jeff T. Linderoth, Eva K. Lee, Martin W. P. Savelsbergh:
A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems. 191-209 - John W. Chinneck:
Fast Heuristics for the Maximum Feasible Subsystem Problem. 210-223 - Alberto Caprara, Giuseppe Lancia, See-Kiong Ng:
Sorting Permutations by Reversals Through Branch-and-Price. 224-244 - Steven Chamberland, Brunilde Sansò:
On the Design Problem of Multitechnology Networks. 245-256
Volume 13, Number 4, 2001
- W. David Kelton:
From the Editor. 257- - Vipul Jain, Ignacio E. Grossmann:
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems. 258-276 - Natalie M. Steiger, James R. Wilson:
Convergence Properties of the Batch Means Method for Simulation Output Analysis. 277-293 - Todd S. Munson, Francisco Facchinei, Michael C. Ferris, Andreas Fischer, Christian Kanzow:
The Semismooth Algorithm for Large Scale Complementarity Problems. 294-311 - Huifen Chen:
Initialization for NORTA: Generation of Random Vectors with Specified Marginals and Correlations. 312-331 - Xiao-Bai Li, James R. Sweigart, James T. C. Teng, Joan M. Donohue, Lori A. Thombs:
A Dynamic Programming Based Pruning Method for Decision Trees. 332-344 - Felisa J. Vázquez-Abad, Sheldon H. Jacobson:
Phantom Harmonic Gradient Estimators for Nonpreemptive Priority Queueing Systems. 345-359 - Constantine N. Goulimis:
Technical Note on "Optimal Integer Solutions to Industrial Cutting Stock Problems" by Degraeve and Schrage. 360-
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-20 23: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:
