package edu.neu.ccs.csu670.components.knapsacksolver;

import edu.neu.ccs.demeterf.demfgen.lib.List;

/**
 * Determines a good subset of items to chose based on trying to
 * optimize value within the weight constraints.  Implementations
 * may make different compromises about speed vs. trying to find
 * the optimal solution.
 * 
 * @author David Halperin (halperin.dr@gmail.com)
 */
public interface KnapsackSolver {
  
  public <T> List<T> choose(
      List<KnapsackItem<T>> items, 
      double maxWeight);

}