Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
26
click to vote
SIAMDM
2010
favorite
Email
discuss
report
105
views
more
SIAMDM 2010
»
Minimal Inequalities for an Infinite Relaxation of Integer Programs
13 years 6 months ago
Download
www.math.ucdavis.edu
We show that maximal S-free convex sets are polyhedra when S is the set of integral points in some rational polyhedron of Rn . This result extends a theorem of Lov
Amitabh Basu, Michele Conforti, Gérard Corn
Real-time Traffic
Maximal Lattice-free Convex
|
Maximal S-free Convex
|
S-free Convex Sets
|
SIAMDM 2010
|
claim paper
Post Info
More Details (n/a)
Added
21 May 2011
Updated
21 May 2011
Type
Journal
Year
2010
Where
SIAMDM
Authors
Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
Comments
(0)
Researcher Info
SIAMDM 1998 Study Group
Computer Vision