<--- Back to Details
First PageDocument Content
Operations research / NP-complete problems / Combinatorial optimization / Mathematical optimization / Job shop scheduling / Bin packing problem / Approximation algorithm / Optimization problem / Knapsack problem / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2007-09-03 21:58:04
Operations research
NP-complete problems
Combinatorial optimization
Mathematical optimization
Job shop scheduling
Bin packing problem
Approximation algorithm
Optimization problem
Knapsack problem
Theoretical computer science
Computational complexity theory
Applied mathematics

Add to Reading List

Source URL: www.columbia.edu

Download Document from Source Website

File Size: 1,68 MB

Share Document on Facebook

Similar Documents

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

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

DocID: 1rrUb - View Document

Computational complexity theory / Mathematics / NP-complete problems / Theory of computation / Packing problems / Operations research / Approximation algorithms / Knapsack problem / Vertex cover / Bin packing problem / Hardness of approximation / Algorithm

Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014

DocID: 1rdLy - View Document

Geometry / Polygons / Mathematics / Space / Art gallery problem / Polygon / Vertex / Convex polygon / Simple polygon / Star polygon / Visibility graph / Knapsack problem

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

Operations research / Mathematics / Mathematical analysis / Computational complexity theory / Knapsack problem / Cutting stock problem / Dynamic programming / Pi / Linear programming / Mathematical optimization / Column generation

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