Welcome to P K Kelkar Library, Online Public Access Catalogue (OPAC)

Normal view MARC view ISBD view

Graph Theory and Combinatorial Optimization

Contributor(s): Avis, David [editor.] | Hertz, Alain [editor.] | Marcotte, Odile [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookPublisher: Boston, MA : Springer US, 2005.Description: XVI, 266 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9780387255927.Subject(s): Business | Operations research | Decision making | Computer mathematics | Mathematical models | Mathematical optimization | Management science | Combinatorics | Business and Management | Operation Research/Decision Theory | Operations Research, Management Science | Combinatorics | Optimization | Mathematical Modeling and Industrial Mathematics | Computational Mathematics and Numerical AnalysisDDC classification: 658.40301 Online resources: Click here to access online
Contents:
Variable Neighborhood Search for Extremal Graphs. XI. Bounds on Algebraic Connectivity -- Problems and Results on Geometric Patterns -- Data Depth and Maximum Feasible Subsystems -- The Maximum Independent Set Problem and Augmenting Graphs -- Interior Point and Semidefinite Approaches in Combinatorial Optimization -- Balancing Mixed-Model Supply Chains -- Bilevel Programming: A Combinatorial Perspective -- Visualizing, Finding and Packing Dijoins -- Hypergraph Coloring by Bichromatic Exchanges.
In: Springer eBooksSummary: Graph theory is very much tied to the geometric properties of optimization and combinatorial optimization. Moreover, graph theory's geometric properties are at the core of many research interests in operations research and applied mathematics. Its techniques have been used in solving many classical problems including maximum flow problems, independent set problems, and the traveling salesman problem. Graph Theory and Combinatorial Optimization explores the field's classical foundations and its developing theories, ideas and applications to new problems. The book examines the geometric properties of graph theory and its widening uses in combinatorial optimization theory and application. The field's leading researchers have contributed chapters in their areas of expertise.
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode Item holds
E books E books PK Kelkar Library, IIT Kanpur
Available EBK5485
Total holds: 0

Variable Neighborhood Search for Extremal Graphs. XI. Bounds on Algebraic Connectivity -- Problems and Results on Geometric Patterns -- Data Depth and Maximum Feasible Subsystems -- The Maximum Independent Set Problem and Augmenting Graphs -- Interior Point and Semidefinite Approaches in Combinatorial Optimization -- Balancing Mixed-Model Supply Chains -- Bilevel Programming: A Combinatorial Perspective -- Visualizing, Finding and Packing Dijoins -- Hypergraph Coloring by Bichromatic Exchanges.

Graph theory is very much tied to the geometric properties of optimization and combinatorial optimization. Moreover, graph theory's geometric properties are at the core of many research interests in operations research and applied mathematics. Its techniques have been used in solving many classical problems including maximum flow problems, independent set problems, and the traveling salesman problem. Graph Theory and Combinatorial Optimization explores the field's classical foundations and its developing theories, ideas and applications to new problems. The book examines the geometric properties of graph theory and its widening uses in combinatorial optimization theory and application. The field's leading researchers have contributed chapters in their areas of expertise.

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha