Ben

Thanks for this post, @vkartha ! It'll also be helpful for testing direct conversion routines that maybe written in the future.

@vkartha , how does the `distMat` of your example (a `dgcMatrix`) mark the distinction between forbidden pairings (infinite distances) versus perfect pairings (zero distances)?

- I think Jake's right that `caliper()` and `caliper=` do not recognize named subproblems. - I don't know that we have a solution for this problem at present, unfortunately. certainly...

Right now (early May, 2014) @PSolenberger is looking into achieving this with the RELAX solver, by tapping into the "sensitivity analysis" code that's bundled with it. This would require storing...

Adam Rauh (@adamrauh) is working on this problem now (summer 2017), on a separate fork of the hinting branch. As I see it, the next things we need are: 1....

Correction to prev comment: reduced costs associate w/ arcs, not nodes. See [definition](http://web.mit.edu/dimitrib/www/netbook_Full_Book.pdf#page=237) in Bertsekas's book, along with [explanation of how arcs' reduced costs classify the arcs as inactive, balanced...

Update: We decided today that the next milestone to work toward is a version of SubDivStrat that optionally accepts one or more arguments recording reduced costs in double precision, and...

[hinting ae9b6b0] does three things: pulls updates on master over the last 18 months or so into the hinting branch; adjusts`fmatch` to set the ["stablity increment"](http://dept.stat.lsa.umich.edu/~bbh/hansenKlopfer2006.pdf#page=15) explicitly, and implements a...

@adamrauh the reduced costs will work out in such a way that you get the same answer either way. If not, there's a mistake somewhere. (If you see an issue...

An update, drawn from email from @adamrauh: > Some progress: > 1) Calculating the node prices is just a tad more complicated (but not much more) than a one or...