Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDINFORMS Journal on Computing, Volume 7
Volume 7, Number 1, Winter 1995
- Donald L. Miller:
A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems. 1-9 - George Kontoravdis, Jonathan F. Bard:
A GRASP for the Vehicle Routing Problem with Time Windows. 10-23 - Moustapha Diaby, R. Ramesh:
The Distribution Problem with Carrier Service: A Dual Based Penalty Approach. 24-35 - Joseph Abate, Ward Whitt:
Numerical Inversion of Laplace Transforms of Probability Distributions. 36-43 - Stein W. Wallace, Roger J.-B. Wets:
Preprocessing in Stochastic Programming: The Case of Capacitated Networks. 44-62 - S. Thomas McCormick, Michael L. Pinedo:
Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis. 63-77 - Dilip Chhajed, Vijay Chandru:
Hulls and Efficient Sets for the Rectilinear Norm. 78-83 - Thomas M. Liebling, François Margot, Didier Müller, Alain Prodon, Lynn Stauffer:
Disjoint Paths in the Plane. 84-88 - Lee K. Jones, Richard C. Larson:
Efficient Computation of Probabilities of Events Described by Order Statistics and Applications to Queue Inference. 89-100 - Daniel P. Heyman, Meredith J. Goldsmith:
Comparisons Between Aggregation/Disaggregation and a Direct Algorithm for Computing the Stationary Probabilities of a Markov Chain. 101-108 - Kurt M. Bretthauer, Bala Shetty, Siddhartha Syam:
A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems. 109-116
Volume 7, Number 2, Spring 1995
- R. Bruce Mattingly:
A Revised Stochastic Complementation Algorithm for Nearly Completely Decomposable Markov Chains. 117-124 - Peter J. Downey:
Bounds and Approximations for Overheads in the Time to Join Parallel Forks. 125-139 - David L. Jagerman, Benjamin Melamed:
Spectral Analysis of Basic TES Processes. 140-148 - June S. Park, Robert Bartoszynski, Walter A. Rosenkrantz:
Stability of p-Persistent CSMA/CD. 149-159 - Carsten Jordan, Andreas Drexl:
A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups. 160-165 - Robert Fourer, David M. Gay:
Expressing Special Structures in an Algebraic Modeling Language for Mathematical Programming. 166-190 - Mauro Dell'Amico, Silvano Martello:
Optimal Scheduling of Tasks on Identical Parallel Processors. 191-200 - Sunan Han, Dawei Hong, Joseph Y.-T. Leung:
On the Asymptotic Optimality of Multiprocessor Scheduling Heuristics for the Makespan Minimization Problem. 201-204 - Harvey J. Greenberg:
Analyzing the Pooling Problem. 205-217 - Abraham Mehrez, Geoffrey Steinberg:
A Matching Identification Problem: A Knowledge Acquisition Approach. 218-231 - A. M. A. Hariri, Chris N. Potts, Luk N. Van Wassenhove:
Single Machine Scheduling to Minimize Total Weighted Late Work. 232-242
Volume 7, Number 3, Summer 1995
- Amit Basu:
Introduction to the Cluster on Knowledge and Data Management. 243 - Sudha Ram, Sridhar Narasimhan:
Incorporating the Majority Consensus Concurrency Control Mechanism into the Database Allocation Problem. 244-256 - Ram D. Gopal, Ram Ramesh, Stanley Zionts:
Access Path Optimization in Relational Joins. 257-268 - Paulo B. Góes:
A Stochastic Model for Performance Evaluation of Main Memory Resident Database Systems. 269-282 - Evangelos Triantaphyllou, Allen L. Soyster:
A Relationship Between CNF and DNF Systems Derivable from Examples. 283-285 - Rajan Srikanth:
A Graph Theory-Based Approach for Partitioning Knowledge Bases. 286-297 - Donald L. Miller, Joseph F. Pekny:
A Staged Primal-Dual Algorithm for Perfect b-Matching with Edge Capacities. 298-320 - Leon S. Lasdon, John C. Plummer, Gang Yu:
Primal-Dual and Primal Interior Point Algorithms for General Nonlinear Programs. 321-332 - Stephan Olariu, James L. Schwing, Jingyuan Zhang:
Interval Graph Problems on Reconfigurable Meshes. 333-348 - Thomas W. Archibald, K. I. M. McKinnon, Lyn C. Thomas:
Performance Issues for the Iterative Solution of Markov Decision Processes on Parallel Computers. 349-357 - Nils Jacob Berland:
Load Balancing in Hypercube Solution of Stochastic Optimization Problems. 358-364
Volume 7, Number 4, Fall 1995
- Ananth Grama, Vipin Kumar:
Parallel Search Algorithms for Discrete Optimization Problems. 365-385 - Elizabeth A. Eschenbach, Christine A. Shoemaker, Hugh M. Caffey:
Parallel Algorithms for Stochastic Dynamic Programming with Continuous State and Control Variables. 386-401 - Jonathan Eckstein, I. Ilkay Boduroglu, Lazaros C. Polymenakos, Donald Goldfarb:
Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2. 402-416 - T. C. Hu, Andrew B. Kahng, Chung-Wen Albert Tsao:
Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods. 417-425 - Fred W. Glover
:
Tabu Thresholding: Improved Search by Nonmonotonic Trajectories. 426-442 - Jeffrey W. Herrmann, Chung-Yee Lee:
Solving a Class Scheduling Problem with a Genetic Algorithm. 443-452 - Robert H. Storer, S. David Wu, Renzo Vaccari:
Problem and Heuristic Space Search Strategies for Job Shop Scheduling. 453-467 - David L. Woodruff:
Ghost Image Processing for Minimum Covariance Determinants. 468-473 - Joseph Czyzyk, Robert Fourer, Sanjay Mehrotra:
A Study of the Augmented System and Column-Splitting Approaches for Solving Two-Stage Stochastic Linear Programs by Interior-Point Methods. 474-490
a service of 
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-04-18 21:10 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:
