Skip to content

Latest commit

 

History

History
50 lines (48 loc) · 2.51 KB

index.md

File metadata and controls

50 lines (48 loc) · 2.51 KB
title layout description links library-name library-icon library-description block-1 block-2 stats
Home | PLANLib
home
This library offers streamlined solutions for tackling planning and network flow challenges. Dive into efficient tools and resources tailored to solve complex scheduling, logistics, and resource management problems. Whether you’re exploring optimization or need robust decision-making support, PLANLib’s homepage is your starting point for powerful, user-friendly planning solutions.
type url text
link
/addProblem
Add a Problem
type name items
dropdown
Problems
url text
/problems/problems_by_id.html
Ordered by ID
url text
/problems/problems_by_category.html
Ordered by Category
url text
/problems/problems_by_language.html
Ordered by Language
PLANLib
fa-flask
A General-Usage Library for Constraint Problems
main-question question-answer spacer table-values
What is PLANLib?
PLANLib is a general-purpose library web application designed to organize, display, reference, and help solvers in anything related to planning problems.
Here you will find:
A recollection of diverse planning problems submitted by users or used during instances of the International Planning Competition (IPC)
The different models, generators, instances, and variations that problems might have
All relevant references for the problem, its sources and details.
main-question question-answer
What is the motivation behind PLANLib?
The main motivation behind this project was to create a centralised platform that allows for planners from all over the world to contribute to the community with new problems and new solutions in the most streamlined fashion possible. <br> It also establishes a historical repository of past problems that might not be available elsewhere on the internet.
main-title stats-block
Library Data
name value
Problems
unique_authors_count
name value
Authors
0
name value
Categories
0