Computer methods in operations research
Considerations in program design evaluation; List processing; Sorting and searching; Networks-fundamental concepts; Critical path methods; Resource constrained scheduling methods; Linear programming methods; Branch and bound methodology; Random number generators; Discrete event simulation programming; Two simulation languages; Index.
What people are saying - Write a review
We haven't found any reviews in the usual places.
CONSIDERATIONS IN PROGRAM DESIGN
CHAPTER in SORTING AND SEARCHING
11 other sections not shown
Other editions - View all
activities algorithm approach array assigned attributes backward pointer block branch and bound bubble sort Bucket CALL cards Chapter column constraint tightness contains data base data items defined developed discrete event simulation discussed duration efficient elements end-of-service entry Erlang Erlang distribution errors evaluation example exponentially distributed facility flowchart format FORTRAN garbage list GPSS graph GUB rows hash code heuristic illustrate implementation incidence matrix initial INODE input inserted JNODE Kolmogorov-Smirnov test large number linked list node objective function optimal solution P-S list parameters performance predecessor present queue Quicksort random deviates random number removed represented resource resource constrained scheduling resulting retrieved scheduling sequence server shown in Fig simplex method simulation language simulation models slack solved sort specified stack Step storage stored structure subroutine successor Table tableau matrix tion transaction tree units urgency factor utility zero