Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger Wattenhofer

First Page		Document Content
Date: 2014-09-26 08:36:25 Computational complexity theory Complexity classes NP-complete problems Operations research Combinatorial optimization Mathematical optimization Knapsack problem Reduction Graph coloring NP-hardness NP Optimization problem		Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger Wattenhofer Add to Reading List Source URL: disco.ethz.ch Download Document from Source Website File Size: 294,30 KB Share Document on Facebook

	Large-scale multi-period precedence constrained knapsack problem: A mining application 1 Eduardo Moreno a,2 Daniel Espinoza b,3 Marcos Goycoolea c,4 a Faculty of Engineering and Science, Universidad Adolfo Iba˜ DocID: 1tPWZ - View Document
	Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger Wattenhofer DocID: 1rrUb - View Document
	Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014 DocID: 1rdLy - View Document
	How to Place Efficiently Guards and Paintings in an Art Gallery Christodoulos Fragoudakis∗†, Euripides Markou∗‡ and Stathis Zachos§ April 25, 2005 Abstract DocID: 1r85C - View Document
	COLUMN GENERATION WITH GAMS ERWIN KALVELAGEN Abstract. This document describes an implementation of a Column Generation algorithm using GAMS. The well-known cutting stock problem and a personnel planning problem are used DocID: 1r5tA - View Document