Skip to content

juliabloggers.com

A Julia Language Blog Aggregator

  • Home
  • Submit Your RSS/Atom Feed

MIP – Travelling Salesman

Sometimes you’re working on a project for too long and just need a funny little break.
In the last article I mentioned numerical error rounding problems. I tried to fix them using various methods.
Probably the best for it is the revised simplex method.
There you’re working with the initial tableau…

Related

This entry was posted in Julia and tagged julia,mip,constraint-programming,linear-programming on October 14, 2017 by OpenSourcES.

Post navigation

← I Like Julia Because It Scales and Is Productive: Some Insights From A Julia Developer Clarification: on orphaning my Common Lisp libraries →

RSS feed

Recent Posts

  • cuTile.jl 1.0: Tile windows, atomics, and sparse views
  • CUDA.jl 6.3: Compiler caching, a new cuDNN, and dependent launches
  • State of Julia's GPU ecosystem in 2026
  • What's New in SciML Since OrdinaryDiffEq v7: Continuation Solvers, Multirate Integrators, and a Pure-Julia Sparse LU
  • AMDGPU.jl 2.6 and 2.7: linear algebra, sparse arrays, and RDNA4 matrix cores
  • Metal.jl 1.10: Linear algebra, FFTs, and a faster runtime
  • SciML Small Grants Program: Two Years In, Eight More Projects Funded and Shipped
  • Julia, custom serialization with JSON.jl
  • cuTile.jl 0.3: CUDA.jl integration, and even better performance & latency
  • TestItems – Modern Julia testing
Proudly powered by WordPress