@techreport{TD:100778,
	att_abstract={{Any min-cost multi-commodity flow can be realized with a link-state routing protocol, PEFT, using uneven traffic splitting. PEFT was derived from a new convex optimization problem, Network Entropy Maximization (NEM), which involves an infinite number of variables. In this paper, we present the compact and equivalent formulation of the NEM problem.}},
	att_authors={dx953w},
	att_categories={},
	att_copyright={{IEEE}},
	att_copyright_notice={{This version of the work is reprinted here with permission of IEEE for your personal use. Not for redistribution. The definitive version was published in 2012. {{, 2012-03-21}}
}},
	att_donotupload={},
	att_private={false},
	att_projects={},
	att_tags={Interior gateway protocol,  routing,  PEFT,  optimization,  network entropy maximization},
	att_techdoc={true},
	att_techdoc_key={TD:100778},
	att_url={http://web1.research.att.com:81/techdocs_downloads/TD:100778_DS1_2012-03-26T14:16:49.283Z.pdf},
	author={Dahai Xu},
	institution={{46th Annual Conference on
Information Sciences and Systems (CISS)}},
	month={March},
	title={{Compact Formulation of Network Entropy Maximization}},
	year=2012,
}