Building Better Nurse Scheduling Algorithms

First Page		Document Content
Date: 2008-03-20 07:15:37 Operations research Mathematical optimization Computational complexity theory Algorithm Mathematical logic Genetic algorithm Linear programming Time complexity Local search Theoretical computer science Applied mathematics Mathematics		Building Better Nurse Scheduling Algorithms Add to Reading List Source URL: arxiv.org Download Document from Source Website File Size: 249,76 KB Share Document on Facebook

	Leveraging Linear and Mixed Integer Programming for SMT Tim King1 Clark Barrett1 1 New DocID: 1xVFF - View Document
	Exploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPs DocID: 1xUZo - View Document
	Mixed-Integer Linear Programming LPBranch-and-Bound Search DocID: 1voVH - View Document
	DECOMPOSITION METHODS FOR INTEGER LINEAR PROGRAMMING by Matthew Galati DocID: 1vkrh - View Document
	Approximate Linear Programming for Constrained Partially Observable Markov Decision Processes Pascal Poupart† , Aarti Malhotra† , Pei Pei† , Kee-Eung Kim§ , Bongseok Goh§ and Michael Bowling‡ † David R. Cher DocID: 1vcNT - View Document