Lift-and-Project Integrality Gaps for the Traveling Salesperson Problem

First Page		Document Content
Date: 2014-04-18 21:30:54 NP-complete problems Operations research Combinatorial optimization Linear programming Travelling salesman problem Linear programming relaxation Relaxation Graph Shortest path problem Theoretical computer science Mathematics Graph theory		Lift-and-Project Integrality Gaps for the Traveling Salesperson Problem Add to Reading List Source URL: cjtcs.cs.uchicago.edu Download Document from Source Website File Size: 463,05 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