Proceedings of the Twenty-Third Australasian Database Conference (ADC 2012), Melbourne, Australia A Branch and Bound Method for Min-dist Location Selection Queries Jianzhong Qi1 Zhenghua Xu2

First Page		Document Content
Date: 2012-04-27 08:47:18 Complexity classes Operations research NP Facility location Branch and bound Time complexity Theoretical computer science Computational complexity theory Applied mathematics		Proceedings of the Twenty-Third Australasian Database Conference (ADC 2012), Melbourne, Australia A Branch and Bound Method for Min-dist Location Selection Queries Jianzhong Qi1 Zhenghua Xu2 Add to Reading List Source URL: people.eng.unimelb.edu.au Download Document from Source Website File Size: 646,98 KB Share Document on Facebook

	Trading Bitcoin and Online Time Series Prediction Muhammad J Amjad Operations Research Center DocID: 1xVYr - View Document
	Order Fulfillment in Online Retailing: What Goes Where by Ping Josephine Xu M.S. Operations Research DocID: 1xVON - View Document
	The NYU Administrative Data Research Facility (ADRF) The data revolution is transforming how executives manage operations and businesses deliver goods and services. Yet when it comes to communities and the government ag DocID: 1xTFQ - View Document
	V ORträge zum Operations Research Kolloquium des Instituts für Operations Research Zeit: Donnerstag, 16. April 2015, 17:30 Uhr DocID: 1vsb3 - View Document
	V ORträge zum Operations Research Kolloquium des Instituts für Operations Research Zeit: Donnerstag, 22. Juni 2017, 17:30 Uhr DocID: 1vomF - View Document