Volume 13,
Number 1,
2001
Volume 13,
Number 2,
2001
- H. Paul Williams, Hong Yan:
Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming.
96-103
Electronic Edition (link) BibTeX
- Dorit S. Hochbaum, Eli V. Olinick:
The Bounded Cycle-Cover Problem.
104-119
Electronic Edition (link) BibTeX
- Celia A. Glass, Chris N. Potts, Vitaly A. Strusevich:
Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops.
120-137
Electronic Edition (link) BibTeX
- Michiel Blom, Sven Oliver Krumke, Willem de Paepe, Leen Stougie:
The Online TSP Against Fair Adversaries.
138-148
Electronic Edition (link) BibTeX
- Christos Alexopoulos, David Goldsman, Gamze Tokol:
Properties of Batched Quadratic-Form Variance Parameter Estimators for Simulations.
149-156
Electronic Edition (link) BibTeX
- Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger:
Non-Approximability Results for Scheduling Problems with Minsum Criteria.
157-168
Electronic Edition (link) BibTeX
- Csaba Mészáros, Jacek Gondzio:
Addendum to "Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method".
169-170
Electronic Edition (link) BibTeX
Volume 13,
Number 3,
2001
- W. David Kelton:
From the Editor.
171
Electronic Edition (link) BibTeX
- Mohan L. Chaudhry, Umesh Chandra Gupta, V. Goswami:
Modeling and Analysis of Discrete-Time Multiserver Queues with Batch Arrivals: GIX/Geom/m.
172-180
Electronic Edition (link) BibTeX
- 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
Electronic Edition (link) BibTeX
- Jeff T. Linderoth, Eva K. Lee, Martin W. P. Savelsbergh:
A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems.
191-209
Electronic Edition (link) BibTeX
- John W. Chinneck:
Fast Heuristics for the Maximum Feasible Subsystem Problem.
210-223
Electronic Edition (link) BibTeX
- Alberto Caprara, Giuseppe Lancia, See-Kiong Ng:
Sorting Permutations by Reversals Through Branch-and-Price.
224-244
Electronic Edition (link) BibTeX
- Steven Chamberland, Brunilde Sansò:
On the Design Problem of Multitechnology Networks.
245-256
Electronic Edition (link) BibTeX
Volume 13,
Number 4,
2001
- W. David Kelton:
From the Editor.
257-
Electronic Edition (link) BibTeX
- Vipul Jain, Ignacio E. Grossmann:
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems.
258-276
Electronic Edition (link) BibTeX
- Natalie M. Steiger, James R. Wilson:
Convergence Properties of the Batch Means Method for Simulation Output Analysis.
277-293
Electronic Edition (link) BibTeX
- Todd S. Munson, Francisco Facchinei, Michael C. Ferris, Andreas Fischer, Christian Kanzow:
The Semismooth Algorithm for Large Scale Complementarity Problems.
294-311
Electronic Edition (link) BibTeX
- Huifen Chen:
Initialization for NORTA: Generation of Random Vectors with Specified Marginals and Correlations.
312-331
Electronic Edition (link) BibTeX
- 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
Electronic Edition (link) BibTeX
- Felisa J. Vázquez-Abad, Sheldon H. Jacobson:
Phantom Harmonic Gradient Estimators for Nonpreemptive Priority Queueing Systems.
345-359
Electronic Edition (link) BibTeX
- Constantine N. Goulimis:
Technical Note on "Optimal Integer Solutions to Industrial Cutting Stock Problems" by Degraeve and Schrage.
360-
Electronic Edition (link) BibTeX
Copyright © Sun May 17 00:03:40 2009
by Michael Ley (ley@uni-trier.de)
