A Branch-and-cut Algorithm for Integer Bilevel Linear Programs S.T. DeNegre∗ T.K Ralphs †

First Page		Document Content
Date: 2010-06-19 14:25:53 Operations research Combinatorial optimization Convex optimization Linear programming Bilevel program Branch and cut Cutting-plane method Branch and bound Duality Mathematical optimization Mathematics Applied mathematics		A Branch-and-cut Algorithm for Integer Bilevel Linear Programs S.T. DeNegre∗ T.K Ralphs † Add to Reading List Source URL: coral.ie.lehigh.edu Download Document from Source Website File Size: 189,92 KB Share Document on Facebook

	Journal of Global Optimization manuscript No. (will be inserted by the editor) Stabilizer-based symmetry breaking constraints for mathematical programs Leo Liberti · James Ostrowski DocID: 1v0h9 - View Document
	OPTIMA 88 Mathematical Optimization Society Newsletter Philippe L. Toint MOS Chair’s Column DocID: 1uTp0 - View Document
	The Annals of Probability 2004, Vol. 32, No. 1B, 1030–1067 © Institute of Mathematical Statistics, 2004 A STOCHASTIC REPRESENTATION THEOREM WITH APPLICATIONS TO OPTIMIZATION AND OBSTACLE PROBLEMS DocID: 1sOP9 - View Document
	Optimization of Electrical Production The production of electricity in France is optimized everyday with the help of a mathematical software developed at Inria, in collaboration with EDF R&D. Substantial performance is a DocID: 1rxID - View Document
	Timed-Elastic-Bands for Time-Optimal Point-To-Point Nonlinear Model Predictive Control DocID: 1ru4i - View Document