Progress in Combinatorial Optimization (Hardcover)

A. Ridha Mahjoub

ISBN 10: 1848212062 / ISBN 13: 9781848212060

Published by ISTE Ltd and John Wiley & Sons Inc, London, 2011

About this Item

Hardcover. This book presents recent developments and new trends in Combinatorial Optimization. Combinatorial Optimization is an active research area that has applications in many domains such as communications, network design, VLSI, scheduling, production, computational biology. In the past 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-worlds problems, and new concepts and theoritical results have been introduced. This book presents recent developments and new trends in Combinatorial Optimization. Combinatorial Optimization is an active research area that has applications in many domains such as communications, network design, VLSI, scheduling, production, computational biology. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Seller Inventory # 9781848212060

Bibliographic Details

• Title: Progress in Combinatorial Optimization (Hardcover)
• Publisher: ISTE Ltd and John Wiley & Sons Inc, London
• Publication Date: 2011
• Language: English
• ISBN 10: 1848212062
• ISBN 13: 9781848212060
• Binding: Hardcover
• Edition: 1st Edition
• Condition: new

About this title

Synopsis

This book presents recent developments and new trends in Combinatorial Optimization. Combinatorial Optimization is an active research area that has applications in many domains such as communications, network design, VLSI, scheduling, production, computational biology. In the past 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-worlds problems, and new concepts and theoritical results have been introduced.

About the Author

A. Ridha Mahjoub is Professor of Operations Research and Combinatorial Optimization at the Paris-Dauphine University, France and member of the LAMSADE laboratory CNRS. His research areas include the theory and applications of polyhedral approaches for solving large NP-hard combinatorial optimization problems, linear and integer programming, network design as well as complexity and graph theory. His publications have appeared in numerous leading journals and he serves as Associate Editor for the journal RAIRO-Operations Research.