Links (past):

• USEFUL OPEN ACCESS LINKS:
  DOAJ -Directory of Open Access Journals (1107 journals)
  ELibM - The Electronic Library of Mathematics (60 journals of math)
  Free Electronic Mathematics Journals
  Annals of Math., Electronic J. Combinatorics, Pacific. J. Math.
  JMLR : J. of Machine Learning Research
  arXiv.org e-print archive
  SPARC, Open Access Newsletter
  "Online or Invisible?"("Free online availability substantially increases a paper's impact") by Steve Lawrence, Nature 2001.
  Lists related to the Open Access movement
  semi open: EUCLID
  LITERATURE DATABASES:
  CiteSeer,  DBLP, Zentralblatt MATH,  EULER, CompuScience, MPRESS             
• Memorial ride for Steve Seiden
• A lot of money for doing math: The Millennium prize problems
• INFORMS resource collection contains many links to OR sites
• Joe Mitchell's Event List contains links to forthcoming conferences
• Lance Fortnow's Complexity Web Log
• Kirk Pruhs collects links to Course Materials on the Net
• A short biography of Andrei Nikolaevich Kolmogorov +++ More information on Andrei Nikolaevich Kolmogorov
• The Erdös number project
• ECCC - The Electronic Colloquium on Computational Complexity
• Journal copyright: thoughts by Reinhard Diestel +++ thoughts by Jeff Erickson +++ an article from the Scientific American ++ gossip page
• Optima (Mathematical Programming Society Newsletter).
• The 1996 issue of the SouthWest Journal of Pure and Applied Mathematics (SWJPAM) contains a paper that proves P=NP. +++ Here is another paper that proves P=NP.
• Theseus and the Minotaur: A motion planning game.
• Some pictures by Arcimboldo.
• An occurence of the Petersen graph in real life.
• Another argument against using MicroSoft products +++ and yet another argument.
• 404
• Yahoo: Operations Research here.
• The Discrete Optimization Network (DONET).
• TSP Page of Applegate, Bixby, Chvátal and Cook.
• OR-LIB at Imperial College.
• Decision Sciences Web
• Optimization Online
• Learning and Teaching Support Network for Maths, Stats and OR
• Scirus Search Engine
• PORTA, a polyhedral representation algorithm. If you provide the algorithm with an integer programming problem, it will return a list of all the extreme points and information about the facets. Also available from the same site is SMAPO, a library of linear descriptions of polytopes of small instances of various integer programming problems.
• Computational Materials for Combinatorial Optimization, maintained by Jon Lee.
• AMPL is a mathematical programming and optimization modeling language. You can input your model into AMPL in a reasonably intuitive way and it will use a solver (such as MINOS or CPLEX) for solving the problem. It is capable of solving linear, nonlinear, and integer programs. Here is local information about AMPL, including information about using it on RCS. You can download the first chapter of the book.
• A compendium of NP optimization problems.
• Myths and counterexamples in optimization. This site shows that you have to be careful about your assumptions when you state some things that are "obvious" in optimization.
• An amusing interview with Vasek Chvatal regarding cutting plane methods for the TSP.
• Here is a page on the history of the TSP, with pictures (including one involving Car 54 and one of the optimal tour for a graph with 15,112 cities). This is part of a larger site on the TSP. Two further references for this problem are TSPBIB and Vasek Chvatal's page on the TSP. Instances of TSP can be obtained from the TSPLIB. Hamilton called the problem of finding a route through the vertices of a icosahedron the Icosian game. A similar problem was posed by Euler: Is it possible for a knight to visit every square of a chessboard without visiting any square twice?
• A list of operations research sites.
• Integer Programming and Recreational Mathematics.
• Online book on Discrete Mathematics and Combinatorial Optimization: The Algorithm Design Manual
• Workshop on Combinatorial Optimization, Bertinoro, Italy, 1st - 6th May 2004.
• Source code for matching algorithms is available at
  • Rutgers University: A lot of source code for network programming problems in various programming languages.
  • Konrad-Zuse-Zentrum Berlin: The same matching source code on a german server, and a lot of software for other math programming problems.
  • Universitaet Bonn: Currently, the most efficient solver for (geo)metrical matching problems.
  • See also here.

   

Conferences:

Past:  SODA'03, in Baltimore +++ MAPSP'03 in Aussois  (France) +++ CTW 2003 in Twente (The Netherlands) +++ ECCO 2003 (general: ECCO) in Molde (Norway) +++  INOC2003 in Paris (France) +++  APPROX 2003 + RANDOM 2003 em Princeton +++ ISMP 2003 and COLOR03 in Copenhagen (Denmark) +++ ICALP'2003 in Eindhoven (Netherlands) +++ MISTA'2003 in Nottingham (UK) +++ ESA'2003 in Budapest (Hungary) +++ AIRO 2003 in Venice (Italy) +++ INFORMS Fall 2003 in Atlanta +++ Combinatorics 2003  in Oporto (Portugal)

Forthcoming: IPCO 2004 in New York Columbia University (general: IPCO) +++ SODA'2004 in New Orleans (USA) +++ CO'2004 in Lancaster (UK) +++ OLA'2004 in Rungstedgaard (Denmark) +++ ICALP'2004 in Turku (Finland) +++ ESA'2004 in Bergen (Norway) +++ MAPSP'2005 in Siena (Italy) +++ INFORMS International 2004 in Banff (Canada) +++ OPTIMIZATION 2004 in Lisbon (Portugal) +++

People and Organizations:

EIDMA +++ MPS +++ EATCS +++ (K)WG +++ TUE +++ Letchford +++

Scientific Societies:

AIRO +++ ALIO +++ APDIO +++ (CORS=SCRO) +++ GOR +++ EMS +++ EURO +++ IFORS +++ INFORMS +++ KORMS +++ MPS +++ OGOR +++ ORSJ +++ ORS +++ ORSS +++ ORSSA +++ SADIO +++ SEIO +++ SIAM +++ SOBRAPO +++ SPE +++ SPM +++ VVS-OR +++ YAD +++

Last update: July 12th, 2005