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
33
click to vote
RIVF
2008
favorite
Email
discuss
report
130
views
Internet Technology
»
more
RIVF 2008
»
On the bounded integer programming
13 years 12 months ago
Download
www.jaist.ac.jp
The best upper time bound for solving the Bounded Integer Programming (BIP) up to now is poly()
Thân Quang Khoát
Real-time Traffic
Deterministic Time
|
Input Size
|
Integer Programming
|
Internet Technology
|
RIVF 2008
|
claim paper
Related Content
»
An linear programming based lower bound for the simple assembly line balancing problem
»
The Linear Programming Polytope of Binary Constraint Problems with Bounded TreeWidth
»
Branch and bound integer and noninteger programming
»
Upper Bounds on the Number of Solutions of Binary Integer Programs
»
ANDOR BranchandBound for Solving Mixed Integer Linear Programming Problems
»
ANDOR BranchandBound Search for Pure 01 Integer Linear Programming Problems
»
An Effective BranchandBound Algorithm for Convex Quadratic Integer Programming
»
On the knapsack closure of 01 Integer Linear Programs
»
Tight Approximation Results for General Covering Integer Programs
more »
Post Info
More Details (n/a)
Added
30 Oct 2010
Updated
30 Oct 2010
Type
Conference
Year
2008
Where
RIVF
Authors
Thân Quang Khoát
Comments
(0)
Researcher Info
Internet Technology Study Group
Computer Vision