Knapsack problem

Results: 111



#Item
1Large-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˜

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˜

Add to Reading List

Source URL: mgoycool.uai.cl

Language: English - Date: 2009-12-30 12:14:55
    2Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald  Roger Wattenhofer

    Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger Wattenhofer

    Add to Reading List

    Source URL: disco.ethz.ch

    Language: English - Date: 2014-09-26 08:36:25
    3Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014

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

    Add to Reading List

    Source URL: resources.mpi-inf.mpg.de

    Language: English - Date: 2014-06-04 08:46:15
    4How to Place Efficiently Guards and Paintings in an Art Gallery Christodoulos Fragoudakis∗†, Euripides Markou∗‡ and Stathis Zachos§ April 25, 2005  Abstract

    How to Place Efficiently Guards and Paintings in an Art Gallery Christodoulos Fragoudakis∗†, Euripides Markou∗‡ and Stathis Zachos§ April 25, 2005 Abstract

    Add to Reading List

    Source URL: emarkou.users.uth.gr

    Language: English - Date: 2016-05-24 11:28:43
    5COLUMN 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

    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

    Add to Reading List

    Source URL: www.amsterdamoptimization.com

    Language: English - Date: 2011-03-16 12:56:11
    6CS264: Homework #1 Due by the beginning of class on Wednesday, October 1, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at htt

    CS264: Homework #1 Due by the beginning of class on Wednesday, October 1, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at htt

    Add to Reading List

    Source URL: theory.stanford.edu

    Language: English - Date: 2014-09-29 11:39:15
    7A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility

    A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility

    Add to Reading List

    Source URL: tandy.cs.illinois.edu

    Language: English - Date: 2015-04-08 19:35:45
    8CS364A: Algorithmic Game Theory Lecture #4: Algorithmic Mechanism Design∗ Tim Roughgarden† October 2,

    CS364A: Algorithmic Game Theory Lecture #4: Algorithmic Mechanism Design∗ Tim Roughgarden† October 2,

    Add to Reading List

    Source URL: theory.stanford.edu

    Language: English - Date: 2015-09-22 16:26:58
    9CS264: Beyond Worst-Case Analysis Lecture #14: Smoothed Analysis of Pareto Curves∗ Tim Roughgarden† November 5,

    CS264: Beyond Worst-Case Analysis Lecture #14: Smoothed Analysis of Pareto Curves∗ Tim Roughgarden† November 5,

    Add to Reading List

    Source URL: theory.stanford.edu

    Language: English - Date: 2014-11-29 15:44:35
    10Distributed Computing Prof. R. Wattenhofer B/M/S/G  Plan my vacation

    Distributed Computing Prof. R. Wattenhofer B/M/S/G Plan my vacation

    Add to Reading List

    Source URL: www.tik.ee.ethz.ch

    Language: English - Date: 2016-06-14 07:19:14