Nonlinear Assignment Problems: Algorithms and Applications / Edition 1

Hardcover (Print)
Buy New
Buy New from BN.com
$156.99
Used and New from Other Sellers
Used and New from Other Sellers
from $158.96
Usually ships in 1-2 business days
(Save 20%)
Other sellers (Hardcover)
  • All (4) from $158.96   
  • New (3) from $158.96   
  • Used (1) from $245.51   

More About This Textbook

Overview

Nonlinear Assignment Problems (NAPs) are natural extensions of the classic Linear Assignment Problem, and despite the efforts of many researchers over the past three decades, they still remain some of the hardest combinatorial optimization problems to solve exactly. The purpose of this book is to provide in a single volume, major algorithmic aspects and applications of NAPs as contributed by leading international experts.
The chapters included in this book are concerned with major applications and the latest algorithmic solution approaches for NAPs. Approximation algorithms, polyhedral methods, semidefinite programming approaches and heuristic procedures for NAPs are included, while applications of this problem class in the areas of multiple-target tracking in the context of military surveillance systems, of experimental high energy physics, and of parallel processing are presented.
Audience: Researchers and graduate students in the areas of combinatorial optimization, mathematical programming, operations research, physics, and computer science.

Read More Show Less

Product Details

  • ISBN-13: 9780792366461
  • Publisher: Springer US
  • Publication date: 11/28/2000
  • Series: Combinatorial Optimization Series , #7
  • Edition description: 2001
  • Edition number: 1
  • Pages: 303
  • Product dimensions: 6.40 (w) x 9.50 (h) x 0.90 (d)

Table of Contents

List of Figures. List of Tables. Preface. Contributing Authors. Introduction; P. Pardalos, L. Pitsoulis. 1. Multi Index Assignment Problems: Complexity, Approximation, Applications; F.C.R. Spieksma. 2. MD Assignment of Data Association; A.B. Poore. 3. Target-Based Weapon Target Assignment Problems; R.A. Murphey. 4. The Nonlinear Assignment Problem in Experimental High Energy Physics; J.-F. Pusztaszeri. 5. Three Index Assignment Problem; L. Qi, D. Sun. 6. Polyhedral Methods for the QAP; V. Kaibel. 7. Semidefinite Programming Approaches to the Quadratic Assignment Problem; H. Wolkowicz. 8. Heuristics for Nonlinear Assignment Problems; S. Voss. 9. Symbolic Scheduling of Parameterized Task Graphs on Parallel Machines; M. Cosnard, et al. 10. Decomposition Algorithms for Communication Minimization in Parallel Computing; I.T. Christou, R.R. Meyer.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)