Geometric Algorithms and Combinatorial Optimization (Algorithms and Combinatorics)

Geometric Algorithms and Combinatorial Optimization (Algorithms and Combinatorics) pdf epub mobi txt 电子书 下载 2025

出版者:Springer
作者:Martin Grötschel
出品人:
页数:374
译者:
出版时间:1993-09-15
价格:USD 195.00
装帧:Hardcover
isbn号码:9783540567400
丛书系列:
图书标签:
  •  
想要找书就要到 图书目录大全
立刻按 ctrl+D收藏本页
你会得到大惊喜!!

This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. It offers a unifying approach which is based on two fundamental geometric algorithms: the ellipsoid method for finding a point in a convex set and the basis reduction method for point lattices. This book is a continuation and extension of previous research of the authors for which they received the Fulkerson prize, awarded by the Mathematical Programming Society and the American Mathematical Society. The first edition of this book was received enthusiastically by the community of discrete mathematicians, combinatorial optimizers, operations researchers, and computer scientists. To quote just from a few reviews: "The book is written in a very grasping way, legible both for people who are interested in the most important results and for people who are interested in technical details and proofs." #manuscripta geodaetica#1

具体描述

读后感

评分

评分

评分

评分

评分

用户评价

评分

评分

评分

评分

评分

本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度google,bing,sogou

© 2025 book.wenda123.org All Rights Reserved. 图书目录大全 版权所有