Bicriteria Sum-Problems with Polynomially Bounded Non-Dominated Sets


Marketed By :  AV Akademikerverlag   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days

₹ 2,976

Availability: Out of stock


Delivery :

5% Cashback on all Orders paid using MobiKwik Wallet T&C

Free Krispy Kreme Voucher on all Orders paid using UltraCash Wallet T&C
Product Out of Stock Subscription

(Notify me when this product is back in stock)

  • Product Description

Throughout this book several bicriteria sum optimization problems such as minimum spanning tree problems, shortest path problems, minimum cost flow problems, knapsack problems and global minimum cut problems are considered. For each of those problems the size of the non-dominated sets and the polynomial solvability is investigated. Examples for problems having polynomially bounded non-dominated sets, which are NP-hard to compute, are also presented. Additionally, some general conditions guaranteeing that the Pareto set of such sum optimization problems can be computed in polyomial time are presented.

Product Specifications
SKU :COC24836
Country of ManufactureIndia
Product BrandAV Akademikerverlag
Product Packaging InfoBox
In The Box1 Piece
0 Review(s)