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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
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
54
Voted
INFORMS
2011
61
views
more
INFORMS 2011
»
Decorous Lower Bounds for Minimum Linear Arrangement
14 years 9 months ago
Download
www.lancs.ac.uk
Alberto Caprara, Adam N. Letchford, Juan Jos&eacut
Real-time Traffic
INFORMS 2011
|
claim paper
Related Content
»
Geometric lower bounds for parametric matroid optimization
»
Linear Orderings of Random Geometric Graphs
»
A Nonlinear Lower Bound for Planar EpsilonNets
»
Lower Bounds for Howards Algorithm for Finding Minimum MeanCost Cycles
»
Lower bounds for twoperiod grooming via linear programming duality
»
Minimum distance of Hermitian twopoint codes
»
Bounds on the Minimum Mosaic of Population Sequences under Recombination
»
Weierstrass Pairs and Minimum Distance of Goppa Codes
»
Linear MMSE MIMO Channel Estimation with Imperfect Channel Covariance Information
more »
Post Info
More Details (n/a)
Added
14 May 2011
Updated
14 May 2011
Type
Journal
Year
2011
Where
INFORMS
Authors
Alberto Caprara, Adam N. Letchford, Juan José Salazar González
Comments
(0)
Researcher Info
INFORMS 1998 Study Group
Computer Vision