Combinatorial Optimization

Mentions per year

What Hacker News says

• eru · Feb 10, 2020 · Recommends

  …all fluff with not much substance. I found http://jeffe.cs.illinois.edu/teaching/algorithms/ pretty good for an overview over Algorithms. If you like something in a similar vein to TAOCP, the book 'Combinatorial Optimization' by Alexander Schrijver fits the bill. It teaches you everything you ever wanted to know and then some on the mathematics behind problems in P. Just like TAOCP it is also a detailed overview over known…

  on “Ask HN: How Sound Is the “Teach Yourself CS” Learning Resource?” ↗
• eru · Jun 28, 2011 · Recommends

  …mathematics, so I do not trust myself to judge how hard a piece of mathematics is for outsiders. I find the proof cited is easy to read. About your addendum: You could have a look at Alexander Schrijver's "Combinatorial Optimization: Polyhedra and Efficiency". The interesting thing about its style is, that the author manages to make all lines require constant thought, while in most books there are really hard and really easy parts.

  on “How to Read Mathematics” ↗
• eru · Feb 25, 2011 · Recommends

  I have a smart co-worker who also likes Skiena's Algorithm Design Manual. I found that book to fluffy, though. But then I enjoy books like "Combinatorial Optimization - Polyhedra and Efficiency" by Alexander Schrijver. (Not a beginner's book, but it has anything you ever wanted to know about P and NP.)

  on “I'm a cargo cult programmer, help me” ↗
• eru · Jun 20, 2024 · Mentions

  Disclaimer: I have no clue of a complete learning path. But here are some suggestions you might find interesting. If you want to go heavy on complexity, you could try 'Combinatorial Optimization: Polyhedra and Efficiency' by Alexander Schrijver. But it's basically the equivalent of Knuth's Art of Computer Programming for complexity (in terms of rigour and breadth of approach). I have the three…

  on “Rosser's Theorem via Turing Machines (2011)” ↗
• pcbouman · Jul 4, 2021 · Mentions

  …non-linear mathematical optimization is most more typical for many machine learning applications. Many pratical applications in scheduling, logistics, planning etc used linear (integer) programming and combinatorial optimization. The following are some points towards that body of literature. Alexander Schrijver [1] has lecture notes on Combinatorial Optimization on his website [2]. He also has an affordable 1800 page three volume…

  on “Ask HN: Literature for mathematical optimization?” ↗