Skip to main content
SpringerLink
Log in

Nonlinear Assignment Problems

Algorithms and Applications

  • Book
  • © 2000

Overview

Editors:
  1. Panos M. Pardalos

    1. University of Florida, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Leonidas S. Pitsoulis

    1. Princeton University, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Combinatorial Optimization (COOP, volume 7)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (10 chapters)

  1. Front Matter

    Pages i-xxiii
    Download chapter PDF

  2. Multi Index Assignment Problems: Complexity, Approximation, Applications

    • Frits C. R. Spieksma
    Pages 1-12

  3. Multidimensional Assignment Problems Arising in Multitarget and Multisensor Tracking

    • Aubrey B. Poore
    Pages 13-38

  4. Target-Based Weapon Target Assignment Problems

    • Robert A. Murphey
    Pages 39-53

  5. The Nonlinear Assignment Problem in Experimental High Energy Physics

    • Jean-Francois Pusztaszeri
    Pages 55-89

  6. Polyhedral Methods for Solving Three Index Assignment Problems

    • Liqun Qi, Defeng Sun
    Pages 91-107

  7. Polyhedral Methods for the QAP

    • Volker Kaibel
    Pages 109-141

  8. Semidefinite Programming Approaches to the Quadratic Assignment Problem

    • Henry Wolkowicz
    Pages 143-174

  9. Heuristics for Nonlinear Assignment Problems

    • Stefan Voss
    Pages 175-215

  10. Symbolic Scheduling of Parameterized Task Graphs on Parallel Machines

    • Michel Cosnard, Emmanuel Jeannot, Tao Yang
    Pages 217-243

  11. Decomposition Algorithms for Communication Minimization in Parallel Computing

    • Ioannis T. Christou, Robert R. Meyer
    Pages 245-302

  12. Back Matter

    Pages 303-303
    Download chapter PDF
Back to top

Keywords

About this book

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.

Editors and Affiliations

  • University of Florida, USA

    Panos M. Pardalos

  • Princeton University, USA

    Leonidas S. Pitsoulis

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation