This package is available under GPL (>= 3).


All files in src/libqhull are taken from or based on Qhull
(http://www.qhull.org/), and covered by the following license:

All files in src/libqhull/ are taken from or based on

                    Qhull, Copyright (c) 1993-2015
                    
                            C.B. Barber
                           Arlington, MA 
                          
                               and

       The National Science and Technology Research Center for
        Computation and Visualization of Geometric Structures
                        (The Geometry Center)
                       University of Minnesota

                       email: qhull@qhull.org

This software includes Qhull from C.B. Barber and The Geometry Center.  
Qhull is copyrighted as noted above.  Qhull is free software and may 
be obtained via http from www.qhull.org.  It may be freely copied, modified, 
and redistributed under the following conditions:

1. All copyright notices must remain intact in all files.

2. A copy of this text file must be distributed along with any copies 
   of Qhull that you redistribute; this includes copies that you have 
   modified, or copies of programs or other software products that 
   include Qhull.

3. If you modify Qhull, you must include a notice giving the
   name of the person performing the modification, the date of
   modification, and the reason for such modification.

4. When distributing modified versions of Qhull, or other software 
   products that include Qhull, you must provide notice that the original 
   source code may be obtained as noted above.

5. There is no warranty or other guarantee of fitness for Qhull, it is 
   provided solely "as is".  Bug reports or fixes may be sent to 
   qhull_bug@qhull.org; the authors may or may not act on them as 
   they desire.


All files in src/libglpk/ are taken from or based on GLPK (GNU Linear Programming Kit):

The GLPK package is part of the GNU project, released under the aegis of GNU.

Copyright © 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 Andrew Makhorin, Department for Applied Informatics, Moscow Aviation Institute, Moscow, Russia. All rights reserved.

Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.

Verbatim copying and distribution of this entire article are permitted worldwide, without royalty, in any medium, provided this notice, and the copyright notice, are preserved.


All files in src/libglpk/amd are taken from or based on:

AMD Version 2.2, Copyright (C) 2007 by Timothy A. Davis,
Patrick R. Amestoy, and Iain S. Duff.  All Rights Reserved.

Description:

   AMD is a set of routines for pre-ordering sparse matrices prior to
   Cholesky or LU factorization, using the approximate minimum degree
   ordering algorithm.  Written in ANSI/ISO C with a MATLAB interface,
   and in Fortran 77.

Authors:

   Timothy A. Davis (davis at cise.ufl.edu), University of Florida.
   Patrick R. Amestoy, ENSEEIHT, Toulouse, France.
   Iain S. Duff, Rutherford Appleton Laboratory, UK.

AMD License:

   Your use or distribution of AMD or any modified version of AMD
   implies that you agree to this License.

   This library is free software; you can redistribute it and/or
   modify it under the terms of the GNU Lesser General Public License
   as published by the Free Software Foundation; either version 2.1 of
   the License, or (at your option) any later version.

   This library is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
   Lesser General Public License for more details.

   You should have received a copy of the GNU Lesser General Public
   License along with this library; if not, write to the Free Software
   Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301
   USA.

   Permission is hereby granted to use or copy this program under the
   terms of the GNU LGPL, provided that the Copyright, this License,
   and the Availability of the original version is retained on all
   copies.  User documentation of any code that uses this code or any
   modified version of this code must cite the Copyright, this License,
   the Availability note, and "Used by permission."  Permission to
   modify the code and to distribute modified code is granted, provided
   the Copyright, this License, and the Availability note are retained,
   and a notice that the code was modified is included.

   AMD is available under alternate licences; contact T. Davis for
   details.

Availability:

    http://www.cise.ufl.edu/research/sparse/amd


All files in src/libglpk/colamd are taken from or based on:

COLAMD/SYMAMD Version 2.7, Copyright (C) 1998-2007, Timothy A. Davis,
All Rights Reserved.

Description:

   colamd:  an approximate minimum degree column ordering algorithm,
            for LU factorization of symmetric or unsymmetric matrices,
            QR factorization, least squares, interior point methods for
            linear programming problems, and other related problems.

   symamd:  an approximate minimum degree ordering algorithm for
            Cholesky factorization of symmetric matrices.

Purpose:

   Colamd computes a permutation Q such that the Cholesky factorization
   of (AQ)'(AQ) has less fill-in and requires fewer floating point
   operations than A'A.  This also provides a good ordering for sparse
   partial pivoting methods, P(AQ) = LU, where Q is computed prior to
   numerical factorization, and P is computed during numerical
   factorization via conventional partial pivoting with row
   interchanges.  Colamd is the column ordering method used in SuperLU,
   part of the ScaLAPACK library.  It is also available as built-in
   function in MATLAB Version 6, available from MathWorks, Inc.
   (http://www.mathworks.com).  This routine can be used in place of
   colmmd in MATLAB.

   Symamd computes a permutation P of a symmetric matrix A such that
   the Cholesky factorization of PAP' has less fill-in and requires
   fewer floating point operations than A.  Symamd constructs a matrix
   M such that M'M has the same nonzero pattern of A, and then orders
   the columns of M using colmmd.  The column ordering of M is then
   returned as the row and column ordering P of A.

Authors:

   The authors of the code itself are Stefan I. Larimore and Timothy A.
   Davis (davis at cise.ufl.edu), University of Florida.  The algorithm
   was developed in collaboration with John Gilbert, Xerox PARC, and
   Esmond Ng, Oak Ridge National Laboratory.

Acknowledgements:

   This work was supported by the National Science Foundation, under
   grants DMS-9504974 and DMS-9803599.

License:

   This library is free software; you can redistribute it and/or
   modify it under the terms of the GNU Lesser General Public License
   as published by the Free Software Foundation; either version 2.1 of
   the License, or (at your option) any later version.

   This library is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
   Lesser General Public License for more details.

   You should have received a copy of the GNU Lesser General Public
   License along with this library; if not, write to the Free Software
   Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301
   USA.

   Permission is hereby granted to use or copy this program under the
   terms of the GNU LGPL, provided that the Copyright, this License,
   and the Availability of the original version is retained on all
   copies.  User documentation of any code that uses this code or any
   modified version of this code must cite the Copyright, this License,
   the Availability note, and "Used by permission."  Permission to
   modify the code and to distribute modified code is granted, provided
   the Copyright, this License, and the Availability note are retained,
   and a notice that the code was modified is included.

   COLAMD is also available under alternate licenses, contact T. Davis
   for details.

Availability:

   The colamd/symamd library is available at:

   http://www.cise.ufl.edu/research/sparse/colamd/

References:

   T. A. Davis, J. R. Gilbert, S. Larimore, E. Ng, An approximate
   column minimum degree ordering algorithm, ACM Transactions on
   Mathematical Software, vol. 30, no. 3., pp. 353-376, 2004.

   T. A. Davis, J. R. Gilbert, S. Larimore, E. Ng, Algorithm 836:
   COLAMD, an approximate column minimum degree ordering algorithm, ACM
   Transactions on Mathematical Software, vol. 30, no. 3., pp. 377-380,
   2004.


All files in src/libglpk/env are taken from or based on:

zlib general purpose compression library
version 1.2.5, April 19th, 2010

Copyright (C) 1995-2010 Jean-loup Gailly and Mark Adler

This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any damages
arising from the use of this software.

Permission is granted to anyone to use this software for any purpose,
including commercial applications, and to alter it and redistribute it
freely, subject to the following restrictions:

1. The origin of this software must not be misrepresented; you must not
   claim that you wrote the original software. If you use this software
   in a product, an acknowledgment in the product documentation would
   be appreciated but is not required.

2. Altered source versions must be plainly marked as such, and must not
   be misrepresented as being the original software.

3. This notice may not be removed or altered from any source
   distribution.

Jean-loup Gailly        Mark Adler
jloup@gzip.org          madler@alumni.caltech.edu

The data format used by the zlib library is described by RFCs (Request
for Comments) 1950 to 1952 in the files
http://www.ietf.org/rfc/rfc1950.txt (zlib format), rfc1951.txt (deflate
format) and rfc1952.txt (gzip format).


All files in src/libglpk/minisat are taken from or based on:

MiniSat-C v1.14.1
========================================

* Fixed some serious bugs.
* Tweaked to be Visual Studio friendly (by Alan Mishchenko).
  This disabled reading of gzipped DIMACS files and signal handling,
  but none of these features are essential (and easy to re-enable, if
  wanted).

MiniSat-C v1.14
========================================

Ok, we get it. You hate C++. You hate templates. We agree; C++ is a
seriously messed up language. Although we are more pragmatic about the
quirks and maldesigns in C++, we sympathize with you. So here is a
pure C version of MiniSat, put together by Niklas Sorensson.

MiniSat -- Copyright (c) 2005, Niklas Sorensson

Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:

The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
