Merkzettel Warenkorb
Produktbild: Handbook of Combinatorial Optimization
- 13%

Handbook of Combinatorial Optimization

Aus der Reihe Handbook of Combinatorial Optimization
13% sparen

509,99 € UVP 588,49 €

inkl. gesetzl. MwSt., Versandkostenfrei

Lieferung nach Hause

Beschreibung

Produktdetails

Einband

Set mit diversen Artikeln

Erscheinungsdatum

07.09.2013

Abbildungen

XXI, 685 illus., 169 illus. in color. In 5 volumes, not available separately., farbige Illustrationen, schwarz-weiss Illustrationen

Herausgeber

Panos M. Pardalos + weitere

Verlag

Springer Us

Seitenzahl

3409

Maße (L/B/H)

24,1/16/21,6 cm

Gewicht

6050 g

Auflage

Second Edition 2013

Sprache

Englisch

ISBN

978-1-4419-7996-4

Beschreibung

Portrait

Panos M. Pardalos, Ding-Zhu Du, and Ronald Graham are prominent members of the operations research and mathematics communities. See supplementary PDF for additional biography material.

Produktdetails

Einband

Set mit diversen Artikeln

Erscheinungsdatum

07.09.2013

Abbildungen

XXI, 685 illus., 169 illus. in color. In 5 volumes, not available separately., farbige Illustrationen, schwarz-weiss Illustrationen

Herausgeber

Verlag

Springer Us

Seitenzahl

3409

Maße (L/B/H)

24,1/16/21,6 cm

Gewicht

6050 g

Auflage

Second Edition 2013

Sprache

Englisch

ISBN

978-1-4419-7996-4

Herstelleradresse

Springer-Verlag GmbH
Tiergartenstr. 17
69121 Heidelberg
DE

Email: ProductSafety@springernature.com

Kundinnen und Kunden meinen

0 Bewertungen

Informationen zu Bewertungen

Zur Abgabe einer Bewertung ist eine Anmeldung im Konto notwendig. Die Authentizität der Bewertungen wird von uns nicht überprüft. Wir behalten uns vor, Bewertungstexte, die unseren Richtlinien widersprechen, entsprechend zu kürzen oder zu löschen.

Die Bewertungen sind nach Format, Anzahl Sterne und Datum sortiert.

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kund*innen durch Ihre Meinung

Kundinnen und Kunden meinen

0 Bewertungen filtern
  • Produktbild: Handbook of Combinatorial Optimization
  • A Unified Approach for Domination Problems on Different Network Topologies         
    Advanced Techniques for Dynamic Programming         
    Advances in Group Testing       
    Advances in Scheduling Problems        
    Algebrization and Randomization Methods     
    Algorithmic Aspects of Domination in Graphs 
    Algorithms and Metaheuristics for Combinatorial Matrices     
    Algorithms for the Satisfiability Problem          
    Bin Packing Approximation Algorithms: Survey and Classification        
    Binary Unconstrained Quadratic Optimization Problem             
    Combinatorial Optimization Algorithms             for Probe Design and Selection Problems
    Combinatorial Optimization in Data Mining     
    Combinatorial Optimization Techniques for Network-based Data Mining        
    Combinatorial Optimization Techniques in Transportation and Logistic Networks
    Complexity Issues on PTAS       
    Computing Distances between Evolutionary Trees      
    Connected Dominating Set in Wireless Networks         
    Connections between Continuous and Discrete Extremum Problems, Generalized Systems and Variational Inequalities               
    Coverage Problems in Sensor Networks            
    Data Correcting Approach for Routing and Location in Networks           
    Dual Integrality in Combinatorial Optimization              
    Dynamical System Approaches to Combinatorial Optimization              
    Efficient Algorithms for Geometric Shortest Path Query Problems      
    Energy Efficiency in Wireless Networks             
    Equitable Coloring of Graphs   
    Faster and Space Efficient Exact Exponential Algorithms: Combinatorial and Algebraic Approaches   
    Fault-Tolerant Facility Allocation          
    Fractional Combinatorial Optimization              
    Fuzzy Combinatorial Optimization Problems   
    Geometric Optimization in Wireless Networks              
    Gradient-Constrained Minimum Interconnection Networks    
    Graph Searching and Related Problems             
    Graph Theoretic Clique Relaxations and Applications 
    Greedy Approximation Algorithms       
    Hardness and Approximation of Network Vulnerability            
    Job Shop Scheduling with Petri Nets   
    Key Tree Optimization
    Linear Programming Analysis of Switching Networks  
    Map of Geometric Minimal Cuts with Applications       
    Max-Coloring   
    Maximum Flow Problems and an NP-complete variant on Edge Labeled Graphs           
    Modern Network Interdiction Problems and Algorithms           
    Network Optimization
    Neural Network Models in Combinatorial Optimization            
    On Coloring Problems 
    Online and Semi-online Scheduling     
    Online Frequency Allocation and Mechanism Design for Cognitive Radio Wireless Networks
    Optimal Partitions        
    Optimization in Multi-Channel Wireless Networks      
    Optimization Problems in Data Broadcasting   
    Optimization Problems in Online Social Networks       
    Optimizing Data Collection Capacity in Wireless Networks      
    Packing Circles in Circles and Applications        
    Partition in High Dimensional Spaces  
    Probabilistic Verification and Non-approximability     
    Protein Docking Problem as Combinatorial Optimization Using Beta-complex              
    Quadratic Assignment Problems           
    Reactive Business Intelligence: Combining the Power of Optimization with Machine Learning
    Reformulation-Linearization Techniques for Discrete Optimization Problems               
    Resource Allocation Problems
    Rollout Algorithms for Discrete Optimization: A Survey            
    Simplicial Methods for Approximating Fixed Point with Applications in Combinatorial Optimizations              
    Small World Networks in Computational Neuroscience            
    Social Structure Detection        
    Steiner Minimal Trees:  An Introduction, Parallel Computation and Future Work
    Steiner Minimum Trees in E^3
    Tabu Search      
    Variations of Dominating Set Problem