skip to content
Computer Science and Operations Research. Preview this item
ClosePreview this item

Computer Science and Operations Research.

Author: Osman Balci; Ramesh Sharda; Stavros Andrea Zenios
Publisher: Oxford : Pergamon Press, 1992.
Edition/Format:   eBook : Document : English : First editionView all editions and formats
Summary:
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  Read more...
Getting this item's online copy... Getting this item's online copy...

Find a copy in the library

Getting this item's location and availability... Getting this item's location and availability...

WorldCat

Find it in libraries globally
Worldwide libraries own this item

Details

Genre/Form: Electronic books
Additional Physical Format: Print version:
Balci, Osman.
Computer Science and Operations Research: New Developments in their Interfaces.
Burlington : Elsevier Science, ©2014
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Osman Balci; Ramesh Sharda; Stavros Andrea Zenios
ISBN: 9781483297866 1483297861
OCLC Number: 897646868
Notes: 4. conclusion and open problems.
Includes index.
Description: 1 online resource (549 pages)
Contents: Front Cover; Computer Science and Operations Research: New Developments in Their Interfaces; Copyright Page; Table of Contents; Preface; Referees; PART I: OPTIMIZATION TECHNIQUES; Chapter 1. A Principled Approach to Solving Complex Discrete Optimization Problems; Abstract; Keywords; INTRODUCTION AND BACKGROUND; DESCRIPTION OF OPL; A BENCHMARK OF OPL ALGORITHMS; EXTENDING AND MERGING PROBLEMS; OTHER OPL APPLICATIONS; CONCLUSIONS; BIBLIOGRAPHY; CHAPTER 2. BOOLEAN-COMBINATORIAL BOUNDING OF MAXIMUM 2-SATISFIABILITY; ABSTRACT; KEYWORDS; 1. Maximum 2-satisfiability problems and their reducibility. 2. Connections with roof-duality3. Elementary boolean operations; 4. Squeezing out constants by fusions and exchanges; 5. Equivalence between reducibility and squeezability; 6. Improving the lower bound by consensus and condensations; REFERENCES; CHAPTER 3. NAVAL PERSONNEL ASSIGNMENT: AN APPLICATION OF LINEAR-QUADRATIC PENALTY METHODS; ABSTRACT; KEYWORDS; INTRODUCTION; THE NAVAL PERSONNEL ASSIGNMENT PROBLEM; APPLICATION OF THE LINEAR-QUADRATIC PENALTY METHOD TO NAVAL PERSONNEL ASSIGNMENT; NUMERICAL RESULTS; CONCLUSIONS; REFERENCES. Chapter 4. Preprocessing Schemes and a Solution Method for the Convex Hull Problem in Multidimensional SpaceABSTRACT; KEY WORDS; INTRODUCTION; 1. BACKGROUND; 2. DEFINITIONS, NOTATION AND IMPORTANT TERMS; 3. FIRST STAGE: PREPROCESSING; 4. SECOND STAGE: RESOLUTION; 5. THE FRANK-WOLFE ALGORITHM FOR FINDING PROJECTIONS; 6. IMPLEMENTATION AND COMPUTATIONAL RESULTS; 7. CONCLUSIONS; REFERENCES; PART II: LINEAR PROGRAMMING INTERIOR POINT ALGORITHMS; CHAPTER 5. ADAPTING THE INTERIOR POINT METHOD FOR THE SOLUTION OF LINEAR PROGRAMS ON HIGH PERFORMANCE COMPUTERS; ABSTRACT; KEY WORDS. Hardware platforms for the sparse simplex and the interior point methodchoice of interior point method; parallel sspd solver kernel on a distributed memory computer; the sspd solver kernel on the dap computer; discussion and conclusions; acknowledgements; references; chapter 6. implementation of an interior point lp algorithm on a shared-memory vector multiprocessor; abstract; keywords; introduction; a primal-dual lp algorithm; the cholesky decomposition; implementation; computational experience; conclusions; acknowledgements; references; part iii: networks. Chapter 7. alternate server disciplines for mobile-servers on a congested networkabstract; keywords; 1. introduction; 2. formulation; 3. server disciplines; 4. related theory; 5. conclusions; 6. references; chapter 8. collision dependent performance model for a star topology local area network; abstract; keywords; introduction; the hubnet protocol; formulation of the collision dependent model; conclusions; references; chapter 9. greedy recognition and coloring algorithms for indifference graphs; abstract; keywords; 1. introduction; 2. basics; 3. greedy algorithms.

Abstract:

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 dat.
Retrieving notes about this item Retrieving notes about this item

Reviews

User-contributed reviews

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.