Topics in convex and mixed binary linear optimization Emil Gustavsson Thesis for the degree of Doctor of Philosophy to be defended in public on Friday - Shimshon Amitsur - Document - PDFSEARCH.IO

First Page	Meta Content
	Topics in convex and mixed binary linear optimization Emil Gustavsson Thesis for the degree of Doctor of Philosophy to be defended in public on Friday Add to Reading List Document Date: 2015-05-08 21:34:42 Open Document File Size: 44,64 KB Share Result on Facebook Country Norway / Sweden / / Facility Chalmers University of Technology / University of Bergen / / IndustryTerm primal solutions / feasible solutions / subproblem solutions / primal feasible solutions / branch-and-bound algorithm / / Organization Department of Mathematical Sciences / Chalmers University of Technology / Department of Informatics / University of Bergen / / Person Dag Haugland / Emil Gustavsson / / / Position Professor / / Technology branch-and-bound algorithm / / SocialTag Operations research Linear programming Convex analysis Subgradient method Lagrangian Duality Claude Lemaréchal Strong duality Mathematical optimization Convex optimization

Topics in convex and mixed binary linear optimization Emil Gustavsson Thesis for the degree of Doctor of Philosophy to be defended in public on FridayAdd to Reading List