November[removed]LIDS-P-2276 RELAX-IV: A Faster Version of the RELAX Code for Solving Minimum Cost Flow Problems

First Page		Document Content
Date: 2001-07-10 15:50:54 Systems scientists Network flow Operations research Convex optimization Auction algorithm Dimitri Bertsekas Interior point method Minimum-cost flow problem Shortest path problem Mathematics Applied mathematics Mathematical optimization		November[removed]LIDS-P-2276 RELAX-IV: A Faster Version of the RELAX Code for Solving Minimum Cost Flow Problems Add to Reading List Source URL: web.mit.edu Download Document from Source Website File Size: 504,69 KB Share Document on Facebook

	Index Associativity, 27, 45 A-Priori Algorithm, 224, 225, 231 Attribute, 33 Accessible page, 199 Auction, 305 DocID: 1u74v - View Document
	RANDOMIZATION AND COMPUTATION IN STRATEGIC SETTINGS A DISSERTATION SUBMITTED TO THE DEPARTMENT OF COMPUTER SCIENCE AND THE COMMITTEE ON GRADUATE STUDIES DocID: 1qO3F - View Document
	Algorithms against Anarchy: Understanding Non-Truthful Mechanisms ¨ PAUL DUTTING , London School of Economics ¨ Informatik THOMAS KESSELHEIM, Max-Planck-Institut fur DocID: 1qLPk - View Document
	Combinatorial Auctions with Restricted Complements Ittai Abraham Microsoft Research, Silicon Valley Moshe Babaioff Microsoft Research, Silicon Valley DocID: 1q5aF - View Document
	X Do Externalities Degrade GSP’s Efficiency? Tim Roughgarden, Stanford ´ Tardos, Cornell Eva DocID: 1q0df - View Document