News for hackers. Stuff that matters.
Re:Faster CRDTs: An Adventure in Optimization by davidgl on Sunday August 01, 2021 @11:30AM (#28026976)
Do you have any links for efficient ways to handle time window constraints etc ?
Re:Faster CRDTs: An Adventure in Optimization by knuthsat on Friday August 06, 2021 @05:06AM (#28084817)
https://pubsonline.informs.org/doi/abs/10.1287/ijoc.4.2.146

Constant time feasibility check of inserts and linear time update after insert.

Of course, there are tricks that support multiple simultaneous inserts and tricks that minimize the update of the data structure after insert.

But, if you want to do 2-opt (k-opt) with time windows, then you have to work out the details because no one in academia did.

Re:Faster CRDTs: An Adventure in Optimization by jhgb on Sunday August 01, 2021 @12:04PM (#28027283)
Helsgaun did describe some things in his LKH-3 technical report, although it's quite terse and does not really go into details: http://webhotel4.ruc.dk/~keld/research/LKH-3/LKH-3_REPORT.pd... . You may be better served by just looking at the source code in http://webhotel4.ruc.dk/~keld/research/LKH-3/LKH-3.0.6.tgz if you're interested how some specific constraint is handled.