Computer Science and Operations Research. New Developments in their Interfaces

✍ Scribed by Osman Balci (Auth.)

• Publisher: Elsevier Ltd, Pergamon Press
• Year: 1992
• Tongue: English
• Leaves: 509
• Edition: 1st
• Category: Library

✦ Synopsis

The interface of Operation Research and Computer Science - although elusive to a precise definition - has been a fertile area of both methodological and applied research. The papers in this book, written by experts in their respective fields, convey the current state-of-the-art in this interface across a broad spectrum of research domains which include optimization techniques, linear programming, interior point algorithms, networks, computer graphics in operations research, parallel algorithms and implementations, planning and scheduling, genetic algorithms, heuristic search techniques and data retrieval

✦ Table of Contents

Content:
Titles of related interest, Page ii
Front Matter, Page iii
Copyright, Page iv
PREFACE, Pages ix-x
REFEREES, Page xi
A Principled Approach to Solving Complex Discrete Optimization Problems, Pages 3-21
BOOLEAN-COMBINATORIAL BOUNDING OF MAXIMUM 2-SATISFIABILITY, Pages 23-42
NAVAL PERSONNEL ASSIGNMENT: AN APPLICATION OF LINEAR-QUADRATIC PENALTY METHODS, Pages 43-58
Preprocessing Schemes and a Solution Method for the Convex Hull Problem in Multidimensional Space, Pages 59-70
ADAPTING THE INTERIOR POINT METHOD FOR THE SOLUTION OF LINEAR PROGRAMS ON HIGH PERFORMANCE COMPUTERS, Pages 73-86
IMPLEMENTATION OF AN INTERIOR POINT LP ALGORITHM ON A SHARED-MEMORY VECTOR MULTIPROCESSOR, Pages 87-101
ALTERNATE SERVER DISCIPLINES FOR MOBILE-SERVERS ON A CONGESTED NETWORK, Pages 105-116
COLLISION DEPENDENT PERFORMANCE MODEL FOR A STAR TOPOLOGY LOCAL AREA NETWORK, Pages 117-126
GREEDY RECOGNITION AND COLORING ALGORITHMS FOR INDIFFERENCE GRAPHS, Pages 127-137
MINIMUM GRAPH VERTEX COVERING WITH THE RANDOM NEURAL NETWORK, Pages 139-147
MULTIPLE CLASS G-NETWORKS, Pages 149-157
ON IMPLEMENTING AN ENVIRONMENT FOR INVESTIGATING NETWORK RELIABILITY, Pages 159-173
ANIMATED SENSITIVITY ANALYSIS, Pages 177-195
EDINET - A NETWORK EDITOR FOR TRANSSHIPMENT PROBLEMS WITH FACILITY LOCATION, Pages 197-212
FUNCTIONAL DESCRIPTION OF A GRAPH-BASED INTERFACE FOR NETWORK MODELING (GIN), Pages 213-229
NETPAD: AN INTERACTIVE GRAPHICS SYSTEM FOR NETWORK MODELING AND OPTIMIZATION, Pages 231-243
A CONCURRENT COMPUTING ALGORITHM FOR REAL-TIME DECISION MAKING, Pages 247-266
COMPUTATIONAL EXPERIENCE WITH PARALLEL ALGORITHMS FOR SOLVING THE QUADRATIC ASSIGNMENT PROBLEM, Pages 267-277
ON REPORTING THE SPEEDUP OF PARALLEL ALGORITHMS: A SURVEY OF ISSUES AND EXPERTS, Pages 279-293
OPTIMAL PARALLEL ALGORITHMS FOR COMPUTING A VERTEX OF THE LINEAR TRANSPORTATION POLYTOPE, Pages 295-306
PARALLEL DECOMPOSITION OF MULTICOMMODITY FLOW PROBLEMS USING COERCION METHODS, Pages 307-318
A GRAPH-THEORETIC MODEL FOR THE SCHEDULING PROBLEM AND ITS APPLICATION TO SIMULTANEOUS RESOURCE SCHEDULING, Pages 321-348
INTELLIGENT MODELLING, SIMULATION AND SCHEDULING OF DISCRETE PRODUCTION PROCESSES, Pages 349-362
OOFP–Object Oriented Flow Planning, Pages 363-382
ROMAN: AN INTEGRATED APPROACH TO MANPOWER PLANNING AND SCHEDULING, Pages 383-396
apGA: AN ADAPTIVE PARALLEL GENETIC ALGORITHM, Pages 399-409
GENETIC ALGORITHMS FOR THE TRAVELING SALESMAN PROBLEM WITH TIME WINDOWS, Pages 411-423
INCREASED FLEXIBILITY IN GENETIC ALGORITHMS: THE USE OF VARIABLE BOLTZMANN SELECTIVE PRESSURE TO CONTROL PROPAGATION, Pages 425-440
PARALLEL GENETIC ALGORITHMS IN COMBINATORIAL OPTIMIZATION, Pages 441-453
CONSTRAINT-DIRECTED SEARCH FOR THE ADVANCED REQUEST DIAL-A-RIDE PROBLEM WITH SERVICE QUALITY CONSTRAINTS, Pages 457-474
HEURISTIC SOLUTION PROCEDURES FOR THE GRAPH PARTITIONING PROBLEM, Pages 475-490
NEW EJECTION CHAIN AND ALTERNATING PATH METHODS FOR TRAVELING SALESMAN PROBLEMS, Pages 491-509
ENHANCING DATA RETRIEVAL USING ARTIFICIALLY SYNTHESIZED QUERIES, Pages 513-532
AUTHOR INDEX, Page 533
SUBJECT INDEX, Pages 534-536