• New Age Combinatorial Optimization - Theory And Algoritham New Age Combinatorial Optimization - Theory And Algoritham

New Age Combinatorial Optimization - Theory And Algoritham

Product Code : 9788181286291

Availability: In stock

Rs. 795

Quick Overview

New Age Combinatorial Optimization - Theory And Algoritham


  • Introduction

  • Graphs

  • Linear Programming

  • Linear Programming Algorithms

  • Integer Programming

  • Spanning Trees and Arborescences

  • Shortest Paths

  • Network Flows

  • Minimum Cost Flows

  • Maximum Matchings

  • Weighted Matching

  • b-Matchings and T-Joins

  • Matroids

  • Generalizations of Matroids

  • NP-Completeness

  • Approximation Algorithms

  • The Knapsack Problem

  • Bin Packing

  • Multicommodity Flows and Edge-Disjoint Paths

  • Network Design Problems

  • The Traveling Salesman Problem

  • Facility Location

  • Notation Index

  • Author Index

  • Subject Index

Read more See more product details


Brand / Publisher New Age International
Return Policy 30 Days
Book Type Text Books
Edition 2016
ISBN 9788181286291
Author Bernhard Korte and Jens Vygen
Language English
Subject Mathematics
Pages 597
Binding Paperback


Brand Information

New Age Established in 1966, New Age International Publishers is the market leader in educational books and is now ranked among leading publishing houses bringing out professional and college level textbooks in Commerce & Management, Science & Technology and Medical Sciences. Our current list includes 1500+ titles mainly in STM, which has earned the trust of educators and students alike. Because of our commitment to accuracy, integrity, authenticity and excellence, our books spanning the post secondary learning spectrum from college to career making professional level have transformed NEW AGE into a brand name.

  1. Be the first to review this product

Write Your Own Review

Only registered users can write reviews. Please, log in or register