Spaghetti Optimization

My cookbook about Math, Algorithms, and Programming

RSS

Blog
Archives
Credits

Category: Branch-and-bound

2013

Backtrack Programming in c

Mar 22 2013

posted in DIMACS, branch-and-bound, combinatorial optimization, max clique, max stable set, programming

About Me

The views expressed on this blog are mine and do not necessarily reflect the views of my employers.

My Academic Home Page

My Publications

I do not accept any advertisement. However, you can offer me coffee and brioche or pizza capricciosa through paypal.

Latest Tweets

Tweets by @famo2spaghi Follow @famo2spaghi

My Google+ profile

Recent Posts

An informal and biased Tutorial on Kantorovich-Wasserstein distances
Exercise in Python: remove blanks from strings
Graph Coloring: Column Generation or Column Enumeration?
Big Data and Convex Optimization
The Impact of Preprocessing on the MIPLIB2003

GitHub Repos

Status updating...

@stegua on GitHub

Blogroll

Bartosz Milewski's Programming Cafe
CP is fun
disORiented
Erling's blog
Farkas' Dilemma
IT Best Kept Secret Is Optimization
Michael Trick’s Operations Research Blog
My Constraint Programming Blog
Nathan Brixius
Notes of a humble developer
O.R. by the Beach
Optimization Zen
OR in an OB World
Punk Rock Operations Research
Sebastian Pokutta's blog
Tatu-Search Optimization
The OR Café
The Quest for Optimality

Copyright © 2019 - Stefano Gualandi - Powered by Octopress