Progress in Combinatorial Optimization

Recent Progress

Inbunden, Engelska, 2011

Av A. Ridha Mahjoub, France) Mahjoub, A. Ridha (LAMSADE, Paris-Dauphine University, A Ridha Mahjoub

3 979 kr

Beställningsvara. Skickas inom 5-8 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2011-11-25
Mått165 x 242 x 41 mm
Vikt1 048 g
FormatInbunden
SpråkEngelska
Antal sidor603
FörlagISTE Ltd and John Wiley & Sons Inc
ISBN9781848212060

Tillhör följande kategorier

Optimering inom Naturvetenskap och teknik

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.

Partition inequalities : separation, extensions, and network design / Mourad Baï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 McCormickFinding descriptions of polytopes via extended formulations and liftings / Volker Kaibel, Andreas LoosRelax-and-cut as a preprocessor and warm starter to branch-and-cut / Abilio Lucena, Nelson Maculan, Alexandre Salles Da CunhaWeighted 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 UchoaModel equivalents and cutting-plane decomposition methods for dominance-constrained two-stage stochastic programs / Dimitri Drapkin, Oliver Klaar, Rüdiger SchultzCombinatorial optimization problems arising from interactive congestion situations / Laurent Gourvès, Stefano MorettiCombinatorial optimization methods to determine the rank of a matrix over a communicative ring, with engineering applications / András RecskiRobust routing in communication networks / Walid Ben-Ameur, Adam Ouorou, Mateusz ŻotkiewiczSingle machine scheduling with a common due date : total weighted tardiness problems / Imed Kacem, Hans Kellerer, Vitaly StrusevichConvergent tabu search for optimal partitioning / Fred Glover, Saïd HanafiAn introduction to exponential time exact algorithms for solving NP-hard problems / Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. PaschosModerately exponential approximation / Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos [and others]Progress in semidefinite optimization techniques for satisfiability / Miguel F. AnjosDisjunctive cuts for mixed integer nonlinear programming problems / Pierre Bonami, Jeff Linderoth, Andrea LodiUsing extended MIP formulations for a production/sequencing and a production/distribution problem / Laurence A. WosleyThe two-phase method for multiobjective combinatorial optimization problems / Anthony Przybylski, Xavier Gandibleux, Matthias Ehrgott