| Andrew Cooke | Contents | Latest | RSS | Twitter | Previous | Next

C[omp]ute

Welcome to my blog, which was once a mailing list of the same name and is still generated by mail. Please reply via the "comment" links.

Always interested in offers/projects/new ideas. Eclectic experience in fields like: numerical computing; Python web; Java enterprise; functional languages; GPGPU; SQL databases; etc. Based in Santiago, Chile; telecommute worldwide. CV; email.

Personal Projects

Lepl parser for Python.

Colorless Green.

Photography around Santiago.

SVG experiment.

Professional Portfolio

Calibration of seismometers.

Data access via web services.

Cache rewrite.

Extending OpenSSH.

Last 100 entries

SQL Performance Explained; The Little Manual of API Design; Multiple Word Sizes; CRC - Next Steps; FizzBuzz; Update on CRCs; Decent Links / Discussion Community; Automated Reasoning About LLVM Optimizations and Undefined Behavior; A Painless Guide To CRC Error Detection Algorithms; Tests in Julia; Dave Eggers: what's so funny about peace, love and Starship?; Cello - High Level C Programming; autoreconf needs tar; Will Self Goes To Heathrow; Top 5 BioInformatics Papers; Vasovagal Response; Good Food in Vina; Chilean Drug Criminals Use Subsitution Cipher; Adrenaline; Stiglitz on the Impact of Technology; Why Not; How I Am 5; Lenovo X240 OpenSuse 13.1; NSA and GCHQ - Psychological Trolls; Finite Fields in Julia (Defining Your Own Number Type); Julian Assange; Starting Qemu on OpenSuse; Noisy GAs/TMs; Venezuela; Reinstalling GRUB with EFI; Instructions For Disabling KDE Indexing; Evolving Speakers; Changing Salt Size in Simple Crypt 3.0.0; Logarithmic Map (Moved); More Info; Words Found in Voynich Manuscript; An Inventory Of 3D Space-Filling Curves; Foxes Using Magnetic Fields To Hunt; 5 Rounds RC5 No Rotation; JP Morgan and Madoff; Ori - Secure, Distributed File System; Physical Unclonable Functions (PUFs); Prejudice on Reddit; Recursion OK; Optimizing Julia Code; Cash Handouts in Brazil; Couple Nice Music Videos; It Also Works!; Adaptive Plaintext; It Works!; RC5 Without Rotation (2); 8 Years...; Attack Against Encrypted Linux Disks; Pushing Back On NSA At IETF; Summary of Experimental Ethics; Very Good Talk On Security, Snowden; Locusts are Grasshoppers!; Vagrant (OpenSuse and IDEs); Interesting Take On Mandela's Context; Haskell Cabal O(n^2) / O(n) Fix; How I Am 4; Chilean Charity Supporting Women; Doing SSH right; Festival of Urban Intervention; Neat Idea - Wormholes Provide Entanglement; And a Link....; Simple Encryption for Python 2.7; OpenSuse 13.1 Is Better!; Little Gain...; More Details on Technofull Damage; Palmrest Cracked Too....; Tecnofull (Lenovo Support) Is Fucking Useless; The Neuroscientist Who Discovered He Was a Psychopath; Interpolating Polynomials; Bottlehead Crack as Pre-amp; Ooops K702!; Bottlehead Crack, AKG K701; Breaking RC5 Without Rotation; Great post thank you; Big Balls of Mud; Phabricator - Tools for working together; Amazing Julia RC5 Code Parameterized By Word Size; Chi-Square Can Be Two-Sided; Why Do Brits Accept Surveillance?; Statistics Done Wrong; Mesas Trape from Bravo; European Report on Crypto Primitives and Protocols; Interesting Omissions; Oryx And Crake (Margaret Atwood); Music and Theory; My Arduino Programs; Elliptic Curve Crypto; Re: Licensing Interpreted Code; Licensing Interpreted Code; ASUS 1015E-DS03 OpenSuse 12.3 SSD; translating lettuce feature files into stub steps files; Re: translating lettuce feature files into stub steps files; A Tale of Two Psychiatrists; The Real Reason the Poor Go Without Bank Accounts; The Rational Choices of Crack Addicts; Forgot grouped

© 2006-2013 Andrew Cooke (site) / post authors (content).

Mixed Integer Programming in Python

From: andrew cooke <andrew@...>

Date: Mon, 29 Aug 2011 17:22:25 -0300

The weather in NY has left me with a free afternoon at work, so I have been
looking at mixed integer programming (this is not completely self-indulgent -
it's related to compressive sensing, which we might use).

My motivating example was this question on Stack Overflow -
http://stackoverflow.com/questions/7076349/is-there-a-good-way-to-do-this-type-of-mining

These notes describe largely separate (because I didn't get very far) aspects:
describing that particular problem and Python libraries.


Python Libraries

It seems that mixed integer and linear programming are not, in general, well
supported by open source projects.  See, for example, the comparison of
running times for commercial and open source solutions here:
http://scip.zib.de/

Support in Python reflects that.  My initial candidate was pulp-or
http://code.google.com/p/pulp-or/ but many links there are dead (with ominous
notes about a "transition").  So then I turned to Coopr
https://software.sandia.gov/trac/coopr which, from the text there, may be what
pulp-or is combining with.  However, the documentation was both minimal and
aimed at experts - I really need something more introductory.

At this point I started looking for an implementation in any language, and
identified SCIP http://scip.zib.de/ (as mentioned earlier) as one of the most
active and efficient.  And - a rare positive moment within this work - it has
a Python 3.2 library that looks very nice
http://code.google.com/p/python-zibopt/ although the installation instructions
suggest things are still rather alpha
http://code.google.com/p/python-zibopt/wiki/Installation


Framing the Problem

At first I assumed that the clustering problem described above would be easy
to solve.  But all my initial approaches contained variable numbers of
variables.  This can be avoided, to some extent, by using control variables,
which are binary flags that indicate whether some other variable is used or
not, but the next problem was how to express various constraints as linear
expressions.

I still don't have a perfect solution, but here are some notes to remind me of
how far I have got:

 - By default, every point is in the vertical group for that column.
 - We want to minimise the number of vertical groups, while also minimising
   "gaps" in horizontal groups.
 - Each point has a vertical (1) / horizontal (0) control variable.  The sum
   of these is one contribution to the final weight.
 - Each point has an additional variable which is the horizontal group
   number.  Originally these start at 0 (left) and increment across the row.
 - The sum of the rightmost group number on each row is also minimised.
   This reduces the number of groups.
 - There is a constraint that each successive group number from left to
   right must be the same as the neighbour to the left, or one more.
 - Finally, there is a complex weight that depends on the number of 
   horizontal "gaps" between two points when they have the same group 
   number.  I think this can be generated programmatically, but it's a bit
   complex (especially since it must be ignored when groups are vertical).
   This weight should also be minimised.

Writing that down, it doesn't seem very impressive, but it was a lot of
work... :o(

Andrew

Non-Comemrcial

From: andrew cooke <andrew@...>

Date: Mon, 29 Aug 2011 19:01:52 -0300

The SCIP and related code is non-commercial only.

Andrew

lp_solve

From: andrew cooke <andrew@...>

Date: Mon, 29 Aug 2011 19:40:46 -0300

OK, so it seems like the best-supported (but not fastest or ost advanced)
package is lp_solve, and it also has some kind of python interface.

http://lpsolve.sourceforge.net/

Andrew

Comment on this post