Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
39
views
0
references
Top references
cited by
81
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,684
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Geometric Algorithms and Combinatorial Optimization
other
Author(s):
Martin Grötschel
,
László Lovász
,
Alexander Schrijver
Publication date
(Print):
1993
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Author and book information
Book
ISBN (Print):
978-3-642-78242-8
ISBN (Electronic):
978-3-642-78240-4
Publication date (Print):
1993
DOI:
10.1007/978-3-642-78240-4
SO-VID:
e786ef00-ef87-4efd-a7bc-364af0688161
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Mathematical Preliminaries
pp. 21
Complexity, Oracles, and Numerical Computation
pp. 46
Algorithmic Aspects of Convex Sets: Formulation of the Problems
pp. 64
The Ellipsoid Method
pp. 102
Algorithms for Convex Bodies
pp. 133
Diophantine Approximation and Basis Reduction
pp. 157
Rational Polyhedra
pp. 197
Combinatorial Optimization: Some Basic Examples
pp. 225
Combinatorial Optimization: A Tour d’Horizon
pp. 272
Stable Sets in Graphs
pp. 304
Submodular Functions
Similar content
2,684
Multiplex single cell profiling of chromatin accessibility by combinatorial cellular indexing.
Authors:
Darren Cusanovich
,
Riza Daza
,
Andrew Adey
…
Artificial intelligence-accelerated high-throughput screening of antibiotic combinations on a microfluidic combinatorial droplet system.
Authors:
Deyu Yang
,
Ziming Yu
,
Mengxin Zheng
…
Networks of geometrically coherent faults accommodate Alpine tectonic inversion offshore southwestern Iberia
Authors:
Tiago M. Alves
See all similar
Cited by
81
On the sphere-decoding algorithm I. Expected complexity
Authors:
B. Hassibi
,
H. Vikalo
The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
Authors:
Andreas M. Tillmann
,
Marc E. Pfetsch
Sorting common operations to minimize the number of tardy jobs
Authors:
Claudio Arbib
,
Mara Servilio
,
Giovanni Felici
See all cited by