Um unsere Webseiten für Sie optimal zu gestalten und fortlaufend zu verbessern, verwenden wir Cookies. Durch Bestätigen des Buttons »Akzeptieren« stimmen Sie der Verwendung zu. Über den Button »Einstellungen« können Sie auswählen, welche Cookies Sie zulassen wollen.

AkzeptierenEinstellungen
Zum Hauptinhalt springen
Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Progress in Combinatorial Optimization -

Progress in Combinatorial Optimization

Recent Progress

Ridha Mahjoub (Herausgeber)

Buch | Hardcover
603 Seiten
2011
ISTE Ltd and John Wiley & Sons Inc (Verlag)
978-1-84821-206-0 (ISBN)
CHF 409,95 inkl. MwSt
  • Versand in 10-20 Tagen
  • Versandkostenfrei
  • Auch auf Rechnung
  • Artikel merken
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.

A. Ridha Mahjoub is a full-time professor at University Paris-Dauphine in Paris, France.

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 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, Rüdiger Schultz

Combinatorial optimization problems arising from interactive congestion situations / Laurent Gourvès, Stefano Moretti

Combinatorial optimization methods to determine the rank of a matrix over a communicative ring, with engineering applications / András Recski

Robust routing in communication networks / Walid Ben-Ameur, Adam Ouorou, Mateusz Ż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, Saï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

Verlagsort London
Sprache englisch
Maße 165 x 242 mm
Gewicht 1048 g
Themenwelt Mathematik / Informatik Mathematik Angewandte Mathematik
Mathematik / Informatik Mathematik Finanz- / Wirtschaftsmathematik
ISBN-10 1-84821-206-2 / 1848212062
ISBN-13 978-1-84821-206-0 / 9781848212060
Zustand Neuware
Informationen gemäß Produktsicherheitsverordnung (GPSR)
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich