نتایج جستجو برای: fixedbed column

تعداد نتایج: 74159  

Journal: :American Journal of Civil Engineering and Architecture 2018

Journal: :Bulletin of the New Zealand Society for Earthquake Engineering 1979

2005
ERWIN KALVELAGEN

This document describes an implementation of a Column Generation algorithm using GAMS. The well-known cutting stock problem is used as an example.

Journal: :Int. J. Comput. Geometry Appl. 2001
Joseph S. B. Mitchell Joseph O'Rourke

A compendium of thirty previously published open problems in computational geometry is presented. [SIGACT News, 32(3) Issue, 120 Sep. 2001, 63–72.] The computational geometry community has made many advances in the relatively short (quarter-century) of the field’s existence. Along the way researchers have engaged with a number of problems that have resisted solution. We gather here a list of op...

Journal: :JDFSL 2011
Simson L. Garfinkel

Reverse Engineering is the traditional bread-and-butter of digital forensics research. Companies like Microsoft and Apple deliver computational artifacts (operating systems, applications and phones) to the commercial market. These artifacts are bought and used by billions. Some have evil intent, and (if society is lucky), the computers end up in the hands of law enforcement. Unfortunately the o...

2011
G. Keppel-Aleks P. O. Wennberg R. A. Washenfelder K. J. Davis A. R. Desai S. C. Wofsy

Introduction Conclusions References

2013
Vikraman Arvind Ramprasad Saptharishi

The log-rank conjecture is one of the fundamental open problems in communication complexity. It speculates that the deterministic communication complexity of any two-party function is equal to the log of the rank of its associated matrix, up to polynomial factors. Despite much research, we still know very little about this conjecture. Recently, there has been renewed interest in this conjecture...

2005
Piotr Faliszewski John M. Hitchcock Jack H. Lutz Elvira Mayordomo

Here is a real gift to the field from David Johnson: After a thirteen year intermission, David is restarting his NP-completeness column. His column will now appear about twice yearly in ACM Transactions on Algorithms. Welcome back David, and thanks! And for those for whom a diet of two per year won’t do, meals past can be found at http://www.research.att.com/ ̃dsj/columns.html. As to the Complex...

2010
Matteo Salani Ilaria Vacca Michel Bierlaire

We introduce a new concept in column generation for handling complex large scale optimization problems, called two-stage column generation, where columns for the compact and extensive formulation are simultaneously generated. The new framework is specifically conceived for tackling complex problems that cannot be efficiently solved by standard column generation and exploits the relationship bet...

2006
R. D. Cess

Cloud-climate interactions are one of the greatest uncertainties in contemporary general circulation models (GCMs) (Cess et al. 1989, 1990), and the present study has focused on one aspect of this. Specifically, combined satellite and near-surface shortwave (SW) flux measurements have been used to test the impact of clouds on the SW radiation budget of two GCMs. Concentration is initially on SW...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید