for demand in demands do
	for path in candidate paths do
		for core in cores do
			for link in path do
				Choose first core with enough number of free slices to serve demand
				then
				Calculate ranges of free slices on core
		Calculate common ranges of free slots on every link for path
		then
		Choose first range of slices
	for path in candidate paths do
		Select the shortest path
		then
		Select core with range of slices