Geometry.Net - the online learning center
Home  - Pure_And_Applied_Math - Linear Programming
e99.com Bookstore
  
Images 
Newsgroups
Page 8     141-146 of 146    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8 

         Linear Programming:     more books (100)
  1. Linear Programming: An Introduction with Applications by A. Sultan, 1993-02-16
  2. Linear Programming by Chung, An-Min Chung, 1963-12

141. Stanford Business Software
Sells Fortran 77 optimization codes MINOS (linear programming and nonlinear optimization), SNOPT (large-scale quadratic and nonlinear programming), NPSOL (nonlinear programming), LSSOL (Linearly constrained linear least squares problems and convex quadratic programming), and QPOPT (linear and quadratic programming).
http://www.sbsi-sol-optimize.com/
Welcome to Stanford Business Software's site for distribution of SOL/UCSD Optimization Software;a suite of packages for solving linear, quadratic, and nonlinear programs. The algorithms and software are produced by researchers Walter Murray and Michael Saunders at the Systems Optimization Laboratory (SOL) , Stanford University, and researcher Philip Gill at the Department of Mathematics, UC San Diego.

142. [cs/0609005] The Traveling Salesman Problem: A Linear Programming Formulation Of
by M Diaby 2006 - Cited by 11 - Related articles
http://arxiv.org/abs/cs/0609005
arXiv.org cs
Search or Article-id Help Advanced search All papers Titles Authors Abstracts Full text Help pages
Full-text links:
Download:
Current browse context:
cs
new
recent
DBLP - CS Bibliography
listing bibtex Moustapha Diaby
Bookmark
what is this?
Computer Science > Computational Complexity
Title: The traveling salesman problem: A Linear programming formulation of
Authors: Moustapha Diaby (Submitted on 2 Sep 2006 ( ), last revised 13 May 2007 (this version, v6)) Abstract: In this paper, we present a polynomial-sized linear programming formulation of the Traveling Salesman Problem (TSP). The proposed linear program is a network flow-based model. Numerical implementation issues and results are discussed. Comments: 10 pages; Published in "WSEAS Transactions on Mathematics." Constraints added to rectify minor oversight in proof of proposition 2 (Theoretical development is same). Hofman's claim of a "counter-example" (arXiv cs/0610125 and cs/0611008 ) is invalid: violates constraints 2.11-2.15 Subjects: Computational Complexity (cs.CC) ; Discrete Mathematics (cs.DM)

143. IngMath
Program can be used for study purposes by students and for mathematical calculations by engineers, natural scientists and mathematicians. It covers linear algebra, linear programming, transport optimization and rational functions.
http://www.verw.tu-dresden.de/IngMath/ingmathe.html
Deutsche Version
IngMath

Software package Engineering Mathematics
Short description of IngMath
IngMath (Engineering Mathematics) contains all essential numerical and other methods which are important for the mathematical education of students of technical and economical courses. The program is very easy to manage and may be used to carry out calculations, for mathematical experiments and for demonstrations in lectures and seminars.
Contents: Linear algebra, linear programming, transport optimization, complex numbers and functions, real functions of one or many variables, differential equations (incl. systems), spline functions, systems of nonlinear equations or inequalities, nonlinear regression and others.
Details

Version: 4.68
The shareware version is english, the full version exists in german and in english.
Requirements:
The operation system is DOS. Under WINDOWS 9x/NT/2000/Me/XP one can use the program optimally.
Before using IngMath it is recommanded to close all other programs.
For a german CD-Rom version WINDOWS 9x or higher is needed.

144. MIT Lincoln Laboratory: LINEAR
NEO survey operated by MIT Lincoln Laboratory. Overview, statistics, history, skyplots, discoveries.
http://www.ll.mit.edu/LINEAR/
Home ... Space Control
LINEAR
History of LINEAR
Lincoln Laboratory has a long history of developing electro-optical space surveillance technology for resident space object search, detection, orbit determination, and catalog maintenance of objects in the Earth's orbit.
Minor planet (243) Ida is 58 kilometers long. This image was taken on August 28, 1993, by a CCD camera aboard the NASA Galileo spacecraft.
Contact:
Mission
Data Collection Method
The project uses a pair of Ground-based Electro-Optical Deep Space Surveillance (GEODSS) telescopes at Lincoln Laboratory's Experimental Test Site (ETS) at the White Sands Missile Range in Socorro, New Mexico. The telescopes are equipped with Laboratory-developed charge-coupled device (CCD) electro-optical detectors and collected data is processed onsite to generate observations. Observations are then sent to the main Lincoln Laboratory facility at Hanscom AFB in Lexington, Massachusetts, where they are linked from night to night, checked, and sent to the Minor Planet Center (MPC) . The MPC assigns designations to LINEAR's new discoveries of NEOs, comets, unusual objects, and main belt asteroids.

145. Algorithms In Combinatorial Geometry
One of the well-known early textbooks, by Herbert Edelsbrunner. Includes chapters on arrangements, convex hulls, linear programming, planar point location, Voronoi diagrams, and separation and intersection.
http://www.springer.com/computer/foundations/book/978-3-540-13722-1
Basket USA Change New User Login

146. Michael O'Boyle's Infopage
University of Edinburgh - Auto-parallelising compilers, optimising for locality, compiling for distributed shared memory, adaptive compilation for VLIW processors, linear program transformation theory and practice, parallelisation of commercial languages and applications, compiler directed memory coherence, compiler impact on architecture.
http://www.dcs.ed.ac.uk/home/mob/
Michael O'Boyle
Professor
PhD, University of Manchester, 1992
Email: mob at inf dot ed dot ac dot uk
Phone: 0131 650 5117
NEW July 2010: 2 RA positions and + 2 PhD Studentships Available
2 RA Positions in Machine Learning based Parallelisation for Heterogeneous multi-cores are available from August 20010. 2 PhD Positions in Machine Learning based Parallelisation for Heterogeneous multi-cores are also available from 1st Spetember 20010. Look here here for general information about applying to study for a PhD or MSc in Informatics at Edinburgh.
Research Interests
The primary research question I am interested in is: how can compiler technology best exploit the potential of high performance architectures? Recently we have developed innovative approaches to this problem using machine learning where it outperforms hand designed approaches. I am interested in their interaction with architecture and in particular compiler/architecture co-design . My research interests include:
  • Adaptive compilation. Compilers are unable to keep up with the sustained evolution of computer architecture. I am working on techniques which allow the compiler to learn about the underlying parallel architecture by exploring a transformation based optimisation space.
  • Machine learning based Optimisation. I'm interested in how predictive modelling and feature generation can be used to automate the design of compilers
  • Page 8     141-146 of 146    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8 

    free hit counter