Calendars for the Web provides a server based calendar and scheduling application. It allows unlimited users to share unlimted events per calendar. Calendars for the Web comes with a full-featured browser based interface, is completely customizable (sixteen different calendar view types), fully documented, and supports online administration.
Celebrat is a very easy-to-use, non-interactive, text-mode calendar application. It reads a data file in ASCII format, and prints on stdout a human-language summary of what events will take place up to ten days from now. It also includes a small daemon which announces events that are due by putting a message on every registered terminal, or by integrating the announcement in the bottom line of GNU screen sessions.
METSlib is an object-oriented metaheuristics framework in C++ designed to make implementing or adapting models easy. The model is modular: all the implemented search algorithms can be applied to the same model. METSlib implements the basics of some metaheuristics algorithms, such as Random Restart Local Search, Variable Neighborhood Search, Iterated Local Search, Simulated Annealing, and Tabu Search. For each algorithm, you must implement an objective function, a neighborhood (move manager), and some moves. Tabu Search is one of the fastest ways to generate near-optimal solutions to a wide range of hard combinatorial optimization problems.
Minkowsky is a combination of a calendar, address book, and task management software. It is a client/server application; all data is managed on a server and displayed on the client. It was designed to manage calendars for small-to-mid-sized groups, so it lets you look into other calendars to check who is available for a meeting. To each address in the address book, a memo pad is associated to take memos about phone calls, etc.