ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
7
views
28
references
Top references
cited by
3
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,745
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Integer Programming and Combinatorial Optimization
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube
other
Author(s):
Friedrich Eisenbrand
,
Andreas S. Schulz
Publication date
(Online):
April 30 1999
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
UCL: UN SDG 01 No Poverty
Most cited references
28
Record
: found
Abstract
: not found
Article
: not found
Outline of an algorithm for integer solutions to linear programs
Ralph Gomory
(1958)
0
comments
Cited
85
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
The intractability of resolution
Armin Haken
(1985)
0
comments
Cited
70
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Edmonds polytopes and a hierarchy of combinatorial problems
V. Chvátal
(1973)
0
comments
Cited
66
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1999
Publication date (Online):
April 30 1999
Pages
: 137-150
DOI:
10.1007/3-540-48777-8_11
SO-VID:
874eee14-167f-4623-af99-3182ac3fbd17
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 137
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube
pp. 17
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts
pp. 99
Improved Approximation Algorithms for Capacitated Facility Location Problems
pp. 400
An Introduction to Empty Lattice Simplices
Similar content
3,745
A result concerning two conjectures of Berge and Chvátal
Authors:
M. Gionfriddo
,
S. Milici
Lower bounds for the Chvátal–Gomory rank in the 0/1 cube
Authors:
Gautier Stauffer
,
Sebastian Pokutta
Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
Authors:
Y. Crama
,
E. Boroš
,
P. L. Hammer
See all similar
Cited by
3
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
Authors:
Monique Laurent
Complexity of Semi-algebraic Proofs
Authors:
Dima Grigoriev
,
Edward Hirsch
,
Dmitrii V. Pasechnik
0/1 Polytopes with Quadratic Chvatal Rank
Authors:
Thomas Rothvoss
,
Laura Sanità
See all cited by