컨텐츠로 이동
Research trends in combinatorial optimization : Bonn 2008 해당 항목을 미리보기
닫기해당 항목을 미리보기
확인중입니다…

Research trends in combinatorial optimization : Bonn 2008

저자: William Cook; László Lovász; Jens Vygen
출판사: Berlin : Springer-Verlag, ©2009.
판/형식:   전자도서 : 문서 : 컨퍼런스 간행물 : 영어모든 판과 형식 보기
데이터베이스:WorldCat
요약:
This book, written by leading experts in combinatorial optimization, features in-depth surveys of current research areas in combinatorial optimization in the broad sense, ranging from applied graph theory to mathematical programming. It also contains numerous new results and shows many interesting current research directions. This book will be indispensible for any researcher in combinatorial optimization.
평가:

(아무런 평가가 없습니다.) 0 리뷰와 함께 - 첫번째로 올려주세요.

주제
다음과 같습니다:

 

온라인으로 문서 찾기

도서관에서 사본 찾기

&AllPage.SpinnerRetrieving; 해당항목을 보유하고 있는 도서관을 찾는 중

상세정보

장르/형태: Electronic books
Conference proceedings
Bonn (2008)
Kongress
Congresses
추가적인 물리적 형식: Print version:
Research trends in combinatorial optimization.
Berlin : Springer-Verlag, ©2009
(OCoLC)276807785
명시된 사람: B H Korte
자료 유형: 컨퍼런스 간행물, 문서, 인터넷 자료
문서 형식: 인터넷 자원, 컴퓨터 파일
모든 저자 / 참여자: William Cook; László Lovász; Jens Vygen
ISBN: 9783540767961 3540767967 3540767959 9783540767954 1281871796 9781281871794
OCLC 번호: 310352997
메모: International conference proceedings.
설명: 1 online resource (xviii, 562 pages) : fig., table
내용: On the Location and p-Median Polytopes.- Facet Generating Techniques.- Antimatroids, Betweenness, Convexity.- Euler Complexes.- Strongly Polynomial Algorithm for the Intersection of a Line with a Polymatroid.- A Survey on Covering Supermodular Functions.- Theory of Principal Partitions Revisited.- Locally Dense Independent Sets in Regular Graphs of Large Girth-An Example of a New Approach.- Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems.- The Unbounded Knapsack Problem.- Recent Developments in Discrete Convex Analysis.- Multiflow Feasibility: An Annotated Tableau.- Many Facets of Dualities.- On the Structure of Graphs Vertex Critical with Respect to Connected Domination.- LS-LIB: A Library of Tools for Solving Production Planning Problems.- From Spheres to Spheropolyhedra: Generalized Distinct Element Methodology and Algorithm Analysis.- Graphic Submodular Function Minimization: A Graphic Approach and Applications.- Matroids-the Engineers' Revenge.- On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming.- Single-Sink Multicommodity Flow with Side Constraints.- An Introduction to Network Flows over Time.- Edge-Connectivity Augmentations of Graphs and Hypergraphs.- Some Problems on Approximate Counting in Graphs and Matroids.
다른 제목 Bonn 2008
책임: William J. Cook, Laszlo Lovasz, Jens Vygen, editors.
더 많은 정보:

초록:

Written by leading experts in combinatorial optimization, this book features in-depth surveys of current research areas in combinatorial optimization in the broad sense. These range from applied  더 읽기…

리뷰

편집자의 리뷰

출판사 줄거리

Aus den Rezensionen: "Das Gebiet der kombinatorischen Optimierung umfasst ein weites Spektrum von verschiedenen mathematischen Problemen und Methoden, und ist sowohl aus praktischer als auch aus 더 읽기…

 
사용자-기여 리뷰
GoodReads 리뷰 가져오는 중…
DOGObooks 리뷰를 가지고 오는 중…

태그

첫번째 되기
요청하신 것을 확인하기

이 항목을 이미 요청하셨을 수도 있습니다. 만약 이 요청을 계속해서 진행하시려면 Ok을 선택하세요.

링크된 데이터


<http://www.worldcat.org/oclc/310352997>
library:oclcnum"310352997"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:MediaObject
rdf:typeschema:Book
rdf:valueUnknown value: dct
rdf:valueUnknown value: cnp
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:alternateName"Bonn 2008"@en
schema:bookFormatschema:EBook
schema:contributor
schema:contributor
schema:contributor
schema:copyrightYear"2009"
schema:datePublished"2009"
schema:description"This book, written by leading experts in combinatorial optimization, features in-depth surveys of current research areas in combinatorial optimization in the broad sense, ranging from applied graph theory to mathematical programming. It also contains numerous new results and shows many interesting current research directions. This book will be indispensible for any researcher in combinatorial optimization."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/1074113196>
schema:genre"Conference proceedings"@en
schema:genre"Bonn (2008)"@en
schema:genre"Electronic books"@en
schema:genre"Kongress"@en
schema:inLanguage"en"
schema:name"Research trends in combinatorial optimization Bonn 2008"@en
schema:publication
schema:publisher
schema:url<http://public.eblib.com/choice/publicfullrecord.aspx?p=417548>
schema:url<http://www.springerlink.com/openurl.asp?genre=book&isbn=978-3-540-76796-1>
schema:url<http://site.ebrary.com/id/10257942>
schema:url<http://www.springerlink.com/openurl.asp?genre=book&isbn=978-3-540-76795-4>
schema:url<http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=262080>
schema:url<http://www.myilibrary.com?id=187179>
schema:url<http://dx.doi.org/10.1007/978-3-540-76796-1>
schema:workExample
schema:workExample
schema:workExample
wdrs:describedby

Content-negotiable representations

윈도우 닫기

WorldCat에 로그인 하십시오 

계정이 없으세요? 아주 간단한 절차를 통하여 무료 계정을 만드실 수 있습니다.