Call Us 080-41656200 (Mon-Sat: 10AM-8PM)
Free Shipping above Rs. 1499
Cash On Delivery*

Bicriteria Sum-Problems with Polynomially Bounded Non-Dominated Sets

 

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

 

Check Your Delivery Options

 
Rs. 2,976

Availability: 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
AuthorKathrin Weisbrodt
LanguageEnglish
BindingPaperback
Number of Pages124
Publishing Year2/20/2012
ISBN978-3639388220
Edition1 st
Book TypeMathematics
Country of ManufactureIndia
Product BrandAV Akademikerverlag
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-07-28 00:00:00