Progress in Combinatorial Optimization
Recent Progress
Published on 25. November 2011
Book
Hardback
603 pages
978-1-84821-206-0 (ISBN)
Description
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.
More details
Language
English
Place of publication
London
United Kingdom
Target group
Professional and scholarly
Product notice
Unsewn / adhesive bound
Paper over boards
Dimensions
Height: 234 mm
Width: 160 mm
Thickness: 38 mm
Weight
1043 gr
ISBN-13
978-1-84821-206-0 (9781848212060)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Person
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.
Content
Partition inequalities : separation, extensions, and network design / Mourad Bai?ou, Francisco Barahona, A. Ridha Mahjoub Stable sets in claw-free graphs : a journey through algorithms and polytopes / Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer [and others]
Algorithms for submodular totally dual integral problems / S. Thomas McCormick
Finding descriptions of polytopes via extended formulations and liftings / Volker Kaibel, Andreas Loos
Relax-and-cut as a preprocessor and warm starter to branch-and-cut / Abilio Lucena, Nelson Maculan, Alexandre Salles Da Cunha
Weighted transversals and blockers for some optimization problems in graphs / Cedric Bentz, Marie-Christine Costa, Dominique De Werra [and others]
On a time-dependent formulation and an updated classification of ATSP formulations / Maria Teresa Godinho, Luis Gouveia, Pierre Pesneau [and others]
Cuts over extended formualtions by flow discretization / Eduardo Uchoa
Model equivalents and cutting-plane decomposition methods for dominance-constrained two-stage stochastic programs / Dimitri Drapkin, Oliver Klaar, Ru?diger Schultz
Combinatorial optimization problems arising from interactive congestion situations / Laurent Gourve?s, Stefano Moretti
Combinatorial optimization methods to determine the rank of a matrix over a communicative ring, with engineering applications / Andra?s Recski
Robust routing in communication networks / Walid Ben-Ameur, Adam Ouorou, Mateusz Z?otkiewicz
Single machine scheduling with a common due date : total weighted tardiness problems / Imed Kacem, Hans Kellerer, Vitaly Strusevich
Convergent tabu search for optimal partitioning / Fred Glover, Sai?d Hanafi
An introduction to exponential time exact algorithms for solving NP-hard problems / Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
Moderately exponential approximation / Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos [and others]
Progress in semidefinite optimization techniques for satisfiability / Miguel F. Anjos
Disjunctive cuts for mixed integer nonlinear programming problems / Pierre Bonami, Jeff Linderoth, Andrea Lodi
Using extended MIP formulations for a production/sequencing and a production/distribution problem / Laurence A. Wosley
The two-phase method for multiobjective combinatorial optimization problems / Anthony Przybylski, Xavier Gandibleux, Matthias Ehrgott
Algorithms for submodular totally dual integral problems / S. Thomas McCormick
Finding descriptions of polytopes via extended formulations and liftings / Volker Kaibel, Andreas Loos
Relax-and-cut as a preprocessor and warm starter to branch-and-cut / Abilio Lucena, Nelson Maculan, Alexandre Salles Da Cunha
Weighted transversals and blockers for some optimization problems in graphs / Cedric Bentz, Marie-Christine Costa, Dominique De Werra [and others]
On a time-dependent formulation and an updated classification of ATSP formulations / Maria Teresa Godinho, Luis Gouveia, Pierre Pesneau [and others]
Cuts over extended formualtions by flow discretization / Eduardo Uchoa
Model equivalents and cutting-plane decomposition methods for dominance-constrained two-stage stochastic programs / Dimitri Drapkin, Oliver Klaar, Ru?diger Schultz
Combinatorial optimization problems arising from interactive congestion situations / Laurent Gourve?s, Stefano Moretti
Combinatorial optimization methods to determine the rank of a matrix over a communicative ring, with engineering applications / Andra?s Recski
Robust routing in communication networks / Walid Ben-Ameur, Adam Ouorou, Mateusz Z?otkiewicz
Single machine scheduling with a common due date : total weighted tardiness problems / Imed Kacem, Hans Kellerer, Vitaly Strusevich
Convergent tabu search for optimal partitioning / Fred Glover, Sai?d Hanafi
An introduction to exponential time exact algorithms for solving NP-hard problems / Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
Moderately exponential approximation / Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos [and others]
Progress in semidefinite optimization techniques for satisfiability / Miguel F. Anjos
Disjunctive cuts for mixed integer nonlinear programming problems / Pierre Bonami, Jeff Linderoth, Andrea Lodi
Using extended MIP formulations for a production/sequencing and a production/distribution problem / Laurence A. Wosley
The two-phase method for multiobjective combinatorial optimization problems / Anthony Przybylski, Xavier Gandibleux, Matthias Ehrgott