Optimization over Integers with Robustness in Cost and Few Constraints Kai-Simon Goetzmann1? , Sebastian Stiller2?? , and Claudio Telha3 1 [removed], Institut f¨ - Unimodular matrix - Document - PDFSEARCH.IO

First Page	Meta Content
	Optimization over Integers with Robustness in Cost and Few Constraints Kai-Simon Goetzmann1? , Sebastian Stiller2?? , and Claudio Telha3 1 [removed], Institut f¨ Add to Reading List Document Date: 2011-11-07 10:30:48 Open Document File Size: 283,20 KB Share Result on Facebook / IndustryTerm polynomial algorithm / pseudopolynomial time algorithm / travel time / pseudopolynomial time exact algorithms / elaborate machinery / pseudo-polynomial algorithm / pseudopolynomial exact algorithm / approximation algorithm / approximate solutions / pseudopolynomial algorithm / binary search / pseudopolynomial time 2approximation algorithm / feasible solutions / approximate solution / / Organization School of Management / Operations Research Center / MIT / Institut f¨ / European Commission / / Person Marie-Curie Fellow / / Technology pseudo-polynomial algorithm / approximation algorithm / pseudopolynomial time algorithm / pseudopolynomial algorithm / pseudopolynomial time 2approximation algorithm / polynomial algorithm / / SocialTag Operations research Mathematical optimization Convex optimization Computational complexity theory Approximation algorithms Unimodular matrix Linear programming Optimization problem Robust optimization Theoretical computer science

Optimization over Integers with Robustness in Cost and Few Constraints Kai-Simon Goetzmann1? , Sebastian Stiller2?? , and Claudio Telha3 1 [removed], Institut f¨Add to Reading List