Jetzt 20% Rabatt auf alle English Books. Jetzt in über 4 Millionen Büchern stöbern und profitieren!
Willkommen, schön sind Sie da!
Logo Ex Libris

Data Correcting Approaches in Combinatorial Optimization

  • Kartonierter Einband
  • 124 Seiten
(0) Erste Bewertung abgeben
Bewertungen
(0)
(0)
(0)
(0)
(0)
Alle Bewertungen ansehen
Leseprobe
Data Correcting Approaches in Combinatorial Optimization focuses on algorithmic applications of the well known polynomially solvab... Weiterlesen
20%
72.00 CHF 57.60
Sie sparen CHF 14.40
Print on Demand - Auslieferung erfolgt in der Regel innert 4 bis 6 Wochen.
Bestellung & Lieferung in eine Filiale möglich

Beschreibung

Data Correcting Approaches in Combinatorial Optimization focuses on algorithmic applications of the well known polynomially solvable special cases of computationally intractable problems. The purpose of this text is to design practically efficient algorithms for solving wide classes of combinatorial optimization problems. Researches, students and engineers will benefit from new bounds and branching rules in development efficient branch-and-bound type computational algorithms. This book examines applications for solving the Traveling Salesman Problem and its variations, Maximum Weight Independent Set Problem, Different Classes of Allocation and Cluster Analysis as well as some classes of Scheduling Problems. Data Correcting Algorithms in Combinatorial Optimization introduces the data correcting approach to algorithms which provide an answer to the following questions: how to construct a bound to the original intractable problem and find which element of the corrected instance one should branch such that the total size of search tree will be minimized. The PC time needed for solving intractable problems will be adjusted with the requirements for solving real world problems.

Focuses on algorithmic applications of well known polynomially solvable special cases of computationally intractable problems

Discusses design of practically efficient algorithms for solving wide classes of combinatorial optimization problems??

Presents a new approach to study optimization problems both from theoretical and practical points of view

Includes supplementary material: sn.pub/extras

Includes supplementary material: sn.pub/extras



Klappentext

Data Correcting Algorithms in Combinatorial Optimization focuses on algorithmic applications of the well known polynomially solvable special cases of computationally intractable problems. The purpose of this text is to design practically efficient algorithms for solving wide classes of combinatorial optimization problems. Researches, students and engineers will benefit from new bounds and branching rules in development efficient branch-and-bound type computational algorithms. This book examines applications for solving the Traveling Salesman Problem and its variations, Maximum Weight Independent Set Problem, Different Classes of Allocation and Cluster Analysis as well as some classes of Scheduling Problems. Data Correcting Algorithms in Combinatorial Optimization introduces the data correcting approach to algorithms which provide an answer to the following questions: how to construct a bound to the original intractable problem and find which element of the corrected instance one should branch such that the total size of search tree will be minimized. The PC time needed for solving intractable problems will be adjusted with the requirements for solving real world problems.



Inhalt
-1. Introduction. -2. Maximization of Submodular Functions: Theory and Algorithms. -3. Data Correcting Approach for the Maximization of Submodular Functions. -4. Data Correcting Approach for the Simple Plant Location Problem. References.

Produktinformationen

Titel: Data Correcting Approaches in Combinatorial Optimization
Autor:
EAN: 9781461452850
ISBN: 1461452856
Format: Kartonierter Einband
Herausgeber: Springer New York
Anzahl Seiten: 124
Gewicht: 201g
Größe: H235mm x B155mm x T7mm
Jahr: 2012
Untertitel: Englisch
Auflage: 2012

Weitere Produkte aus der Reihe "SpringerBriefs in Optimization"