Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	November 2001
Genre:	Schulbücher
	Algorithm Analysis and Problem Complexity / Algorithmen und Datenstrukturen / Algorithms / Algorithms & data structures / Business applications / Business mathematics & systems / Business—Data processing / C / Combinatorics / Combinatorics & graph theory / computer science / Computer science—Mathematics / Data Science / Data Structures / Data structures (Computer science) / Datenbanken / Discrete Mathematics / Discrete Mathematics in Computer Science / Information Technology / IT in Business / Mathematical optimization / Maths for computer scientists / Optimization / Unternehmensanwendungen / Wirtschaftsmathematik und -informatik, IT-Management mehr...
ISBN:	9783540428770
EAN-Code:	9783540428770
Verlag:	Springer EN
Einband:	Kartoniert
Sprache:	English
Dimensionen:	H 279 mm / B 216 mm / D 17 mm
Gewicht:	1000 gr
Seiten:	310
Illustration:	X, 310 p.
Zus. Info:	EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025.
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality.