Nonlinear Assignment Problems
Panos M. Pardalos
Reading Time
at 250 WPM5h 3m
The average reader, reading at a speed of 250 WPM, would take 5h 3m to read Nonlinear Assignment Problems.
Personalise your estimate by entering your reading speed below
Test my reading speedEnter speed in words per minute
11
days at 30 min/day
303
total minutes
Nonlinear Assignment Problems
Published
2000
Publisher
Springer US
Pages
303
ISBN-13
9781441948410
ISBN-10
1441948414
Description
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.
Subjects
Introduction to Linear Optimization
William Congreve
Mathematics for Machine Learning
Linear Algebra and Learning from Data
Recent Advances in Computational Optimization
Graphs, algorithms, and optimization
Frequently Asked Questions
How many pages are in Nonlinear Assignment Problems?
This edition of Nonlinear Assignment Problems has approximately 303 pages. Please note, this is an estimate and the exact page count can vary between hardcover, paperback, and e-book versions.
How long does it take to read Nonlinear Assignment Problems?
For most readers, Nonlinear Assignment Problems typically takes between 6h 19m and 4h 13m to complete. This is based on the book's length of approximately 75,750 words and common reading speeds.
Here's a detailed breakdown: • Continuous reading at 250 WPM: approximately 5h 3m of focused reading • Casual reading (30 minutes/day): you could finish in roughly 11 days • Estimated word count: 75,750 words
Your individual reading time will vary based on your personal reading pace, the amount of daily reading time, and your familiarity with the subject matter.
What is the word count of Nonlinear Assignment Problems?
The estimated word count for Nonlinear Assignment Problems is approximately 75,750 words. This figure is calculated using industry-standard methods that consider genre-specific word density patterns, typical formatting and layout characteristics, and standard words-per-page ratios for published books.
This is an approximation — actual word count may vary based on font size, formatting, edition, and the presence of illustrations or charts.
Who is the author of Nonlinear Assignment Problems?
Nonlinear Assignment Problems was written by Panos M. Pardalos.
When was Nonlinear Assignment Problems published?
The publication date for this specific edition is 2000. The original work may have been published on a different date.