Nonlinear Assignment Problems

Algorithms and Applications

  • Panos M. Pardalos
  • Leonidas S. Pitsoulis

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

Table of contents

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.


Operations Research Scheduling algorithm algorithms combinatorial optimization communication complexity mathematical programming optimization programming

Editors and affiliations

  • Panos M. Pardalos
    • 1
  • Leonidas S. Pitsoulis
    • 2
  1. 1.University of FloridaUSA
  2. 2.Princeton UniversityUSA

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag US 2000
  • Publisher Name Springer, Boston, MA
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4419-4841-0
  • Online ISBN 978-1-4757-3155-2
  • Series Print ISSN 1388-3011
  • Buy this book on publisher's site