Encyclopedia of Operations Research and Management Science (Paperback, Softcover Repri)

A Algorithm.- Acceptance sampling.- Accounting prices.- Accreditation.- Active constraint.- Active set methods.- Activity.- Activity-analysis problem.- Activity level.- Acyclic network.- Adjacent.- Adjacent (neighboring) extreme points.- Advertising Kalyanaram/Bass.- Affiliated values bidding model.- Affine transformation.- Affine-scaling algorithm.- Agency theory.- Agriculture and the food industry Bender/Kahan.- AHP.- AI.- Air force operations analysis Thomas.- Airline industry Ryan.- Algebraic modeling languages for optimization Rosenthal.- Algorithm.- Algorithmic complexity.- Alternate optima.- Alternate paths.- Analytic combat model.- Analytic hierarchy process Saaty.- Animation.- Anticycling rules.- Antithetic random variates.- Applied probability.- Arc.- Archimedean axiom.- ARIMA.- Arrival process.- Arrival-point distribution.- Arrow diagram.- Artificial intelligence Greenberg.- Artificial variables.- Assignment problem.- Automation Liberatore.- Availability Ushakov.- Averch-Johnson hypothesis.- Backward chaining.- Backward Kolmogorov equations.- Backward-recurrence time.- Balance equations.- Balking.- Banking Zenios.- Bar chart.- Barrier and distance functions Polyak.- Basic feasible solution.- Basic solution.- Basic variables.- Basis.- Basis inverse.- Basis vector.- Batch shops.- Battle modeling Hartley.- Bayesian decision theory, subjective probability and utility Laskey.- Bayes rule.- Beale tableau.- Bender's decomposition method.- Best-fit decreasing algorithm.- Bidding models Rothkopf.- Big-M method.- Bilevel linear programming.- Binary variable.- Bin-packing Wang/Coleman.- Bipartite graph.- Birth-death process.- Bland's anticycling rules.- Blending problem.- Block-angular system.- Block pivoting.- Block-triangular matrix.- Bootstrapping.- Bounded rationality.- Bounded variable.- Branch.- Branch and bound.- Brownian motion.- BTRAN.- Buffer.- Bulk queues.- Burke's theorem.- Busy period.- Calculus of variations Nash.- Call priorities.- Candidate rules.- Capacitated transportation problem.- Capital budgeting Levary.- CASE.- CDF.- Center for Naval Analyses Harris.- Certainty equivalent.- Certainty factor.- Chain.- Chance-constrained programming.- Chance constraint.- Chaos.- Chapman-Kolmogorov equations.- Chinese postman problem Stewart.- Choice strategies.- Choice theory Adelman.- Chromatic number.- Chromosome.- Circling.- CIM.- Classical optimization.- Closed network.- Cluster analysis Aronson/Sundaram.- Cobb-Douglas production function.- COEA.- Coefficient of variation.- Cognitive mapping.- Coherent system.- Column generation.- Column vector.- Combat model.- Combat simulation.- Combinatorial and integer optimization Hoffman/Padberg.- Combinatorial explosion.- Combinatorics Lawler.- Common random variates.- Common value bidding model.- Communications networks Sykes.- Community operations research.- Complementarity condition.- Complementarity problems Cottle.- Complementary pivot algorithm.- Complementary slackness theorem.- Computational complexity Hall.- Computational geometry Beichl/Bernal/Witzgall/Sullivan.- Computational probability.- Computer science and operations research Sharda.- Concave function.- Conclusion.- Condition number.- Cone.- Congestion system.- Conjugate gradient method.- Connected graph.- Conservation of flow.- Constrained optimization problem.- Constraint.- Constraint qualification.- Construction applications Perry.- Continuous-time Markov chain (CTMC).- Control charts.- Controllable variables.- Control theory Manitius.- Convex combination.- Convex cone.- Convex function.- Convex hull.- Convex polyhedron.- Convex-programming problem.- Convex set.- Convexity rows.- Corner point.- Corporate strategy Hax/Majluf.- Cost analysis Balut/Gulledge.- Cost coefficient.- Cost effectiveness analysis Womer.- Cost range.- Cost row.- Cost slope.- Cost vector.- COV.- Covering problem.- Coxian distribution.- CPM.- CPP.- Cramer's rule.- Crash cost.- Crash time.- Crew scheduling.- Crime and justice Barnett/Malt