Polyhedral Computation (CRM Proceedings & Lecture Notes, 48, Band 48) - Softcover

Inhaltsangabe

This volume brings together six papers based on discussions at a Workshop on Polyhedral Computation held at the Centre de Recherches Mathématiques at the U. of Montréal, Canada, in October 2006, as part of the CRM's theme semester on Combinatorial Optimization. Researchers with theoretical and computational expertise in polyhedral computation discuss combinatorial properties of linear program digraphs, combinatorial techniques for monotone generation problems, polyhedral representation conversion up to symmetries, the multi-parametric linear complementarity problem with sufficient matrices, hyperplane arrangements with large average diameter, and the Nash equilibria of rank-1 games. Also included is a previously unpublished technical report from 1980 by Norman Zadeh, who comments on what has yet to be done in the field and gives a simple pivot rule for the simplex method for which it is still unknown if it yields a polynomial time algorithm. There is no index. Annotation ©2009 Book News, Inc., Portland, OR (booknews.com)

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.