---------------------------------------------------------
Progress in Combinatorial Optimization
ISCO2010
Edited by A. Ridha Mahjoub
Iste & Wiley
ISBN: 9781848212060
Publication Date: October 2011 Hardback 624 pp.
http://www.iste.co.uk/index.php?f=x&ACTION=View&id=449
----------------------------------------------------
Description
This book aims to present recent developments and new trends in
Combinatorial Optimization. The topics include, among others, complexity
analysis, exact and heuristic methods, cutting-plane techniques,
approximation algorithms, computational complexity and network design
algorithms.
Combinatorial Optimization is an active research area that has
applications in many domains such as communications, network design,
VLSI, scheduling, production and computational biology. In recent years,
new results and major advances have been seen in many areas including
computational complexity, approximation algorithms, cutting-plane-based
methods and submodularity function minimization. More efficient and
powerful methods have been developed for approaching real-world
problems, and new concepts and theoretical results have been introduced.
This book presents a collection of chapters surveying some of these
advances
--
-----------------------------------------
A. Ridha Mahjoub
Laboratoire LAMSADE
Université Paris Dauphine
Place du Maréchal de Lattre de Tassigny
75775 Paris Cedex 16
France
Tel: +33 (0)1 44 05 48 96
Fax: +33 (0)1 44 05 40 91
E-mail: mahjoub@lamsade.dauphine.fr
URL: http://www.lamsade.dauphine.fr/~mahjoub
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************