Kategoria BISAC: Mathematics >> Linear & Nonlinear Programming

Today most computer scientists believe that NP-hard problems cannot be solved by polynomial-time algorithms. From the polynomial-time perspective, all NP-complete problems are equivalent but their exponential-time properties vary widely. Why do some NP-hard problems appear to be easier than others? Are there algorithmic techniques for solving hard problems that are significantly faster than the exhaustive, brute-force methods? The algorithms that address these questions are known as exact exponential algorithms.

The history of exact exponential algorithms for NP-hard problems dates back...

Ce livre est une initiation aux approches modernes de l'optimisation mathematique de formes. On y developpe la methodologie ainsi que les outils d'analyse mathematique et de geometrie necessaires a l'etude des variations de domaines. On y trouve une etude systematique des questions geometriques associees a l'operateur de Laplace, de la capacite classique, de la derivation par rapport a une forme, ainsi qu'un FAQ sur les topologies usuelles sur les domaines et sur les proprietes geometriques des formes optimales avec ce qui se passe quand elles n'existent pas, le tout avec une importante...

Covering recent work on Banach and complete metric spaces, this book uses the Baire approach and considers approximate solutions. It presents new results including penalty methods in constrained optimization and extant solutions in parametric optimization.

A collection of 28 refereed papers grouped according to four broad topics: duality and optimality conditions, optimization algorithms, optimal control, and variational inequality and equilibrium problems. Suitable for researchers, practitioners and postgrads.

Borwein is an authority in the area of mathematical optimization, and his book makes an important contribution to variational analysis

Provides a good introduction to the topic

Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering. The book contains eleven chapters written by experts in their respective fields, and covers a wide spectrum of high-interest problems across these discipline domains. Among the contributing authors are Richard Karp of UC Berkeley and Robert Tarjan of Princeton; both are at the pinnacle of research...