public class Item 111 | extends Object112 |
| Constructor and Description | 133 |
|---|
Item(int profit,
136 | int weight)
137 | Default constructor for a knapsack item
138 | |
139 |
| Modifier and Type | 153 |Method and Description | 154 |
|---|---|
int |
157 | getProfit()
158 | The profit of the current item.
159 | |
160 |
int |
163 | getWeight()
164 | The weight of the current item.
165 | |
166 |
String |
169 | toString() |
170 |
public Item(int profit, 200 | int weight)201 |
profit - the profit for this item (we want to maximize this)weight - the weight of the item (this consumes capacity)public int getProfit()224 |
public int getWeight()238 |
| Modifier and Type | 86 |Method and Description | 87 |
|---|---|
static DirectedGraph<Item,String> |
91 | Main.read(File f)
92 | Reads a Precedence Constrained Knapsack Problem as a directed graph from a file
93 | |
94 |
| Constructor and Description | 101 |
|---|
Model(DirectedGraph<Item,String> instance,
105 | int capacity)
106 | Constructor that takes a directed graph with the items and precedence constraints
107 | |
108 |
| Modifier and Type | 86 |Method and Description | 87 |
|---|---|
List<DirectedGraphArc<V,A>> |
91 | DirectedGraph.getArcs()
92 | Gives a list of all arcs currently in the graph
93 | |
94 |
List<DirectedGraphArc<V,A>> |
97 | DirectedGraph.getInArcs(V node)
98 | Gives all the arcs that enter a particular node in the graph.
99 | |
100 |
List<DirectedGraphArc<V,A>> |
103 | DirectedGraph.getOutArcs(V node)
104 | Gives all the arcs that leave a particular node in the graph.
105 | |
106 |
| Modifier and Type | 86 |Method and Description | 87 |
|---|---|
List<Item> |
91 | Model.getSolution()
92 | Create a list of the items for which the decision variables
93 | are one in the current solution of the mathematical program.
94 | |
95 |
static DirectedGraph<Item,String> |
98 | Main.read(File f)
99 | Reads a Precedence Constrained Knapsack Problem as a directed graph from a file
100 | |
101 |
| Modifier and Type | 108 |Method and Description | 109 |
|---|---|
void |
113 | Model.setItem(Item i,
114 | boolean enabled)
115 | Disable an item in the model (fix it to 0) or enable it (either 0 or 1)
116 | |
117 |
| Constructor and Description | 124 |
|---|
Model(DirectedGraph<Item,String> instance,
128 | int capacity)
129 | Constructor that takes a directed graph with the items and precedence constraints
130 | |
131 |
Each package has a page that contains a list of its classes and interfaces, with a summary for each. This page can contain six categories:
80 |Each class, interface, nested class and nested interface has its own separate page. Each of these pages has three sections consisting of a class/interface description, summary tables, and detailed member descriptions:
92 |Each summary entry contains the first sentence from the detailed description for that item. The summary entries are alphabetical, while the detailed descriptions are in the order they appear in the source code. This preserves the logical groupings established by the programmer.
112 |Each annotation type has its own separate page with the following sections:
116 |Each enum has its own separate page with the following sections:
127 |Each documented package, class and interface has its own Use page. This page describes what packages, classes, methods, constructors and fields use any part of the given class or package. Given a class or interface A, its Use page includes subclasses of A, fields declared as A, methods that return A, and methods and constructors with parameters of type A. You can access this page by first going to the package, class or interface, then clicking on the "Use" link in the navigation bar.
137 |There is a Class Hierarchy page for all packages, plus a hierarchy for each package. Each hierarchy page contains a list of classes and a list of interfaces. The classes are organized by inheritance structure starting with java.lang.Object. The interfaces do not inherit from java.lang.Object.
The Deprecated API page lists all of the API that have been deprecated. A deprecated API is not recommended for use, generally due to improvements, and a replacement API is usually given. Deprecated APIs may be removed in future implementations.
149 |The Index contains an alphabetic list of all classes, interfaces, constructors, methods, and fields.
153 |These links take you to the next or previous class, interface, package, or related page.
157 |These links show and hide the HTML frames. All pages are available with or without frames.
161 |The All Classes link shows all classes and interfaces except non-static nested types.
165 |Each serializable or externalizable class has a description of its serialization fields and methods. This information is of interest to re-implementors, not to developers using the API. While there is no link in the navigation bar, you can get to this information by going to any serialized class and clicking "Serialized Form" in the "See also" section of the class description.
169 |The Constant Field Values page lists the static final fields and their values.
173 || Class | 70 |Description | 71 |
|---|---|
| DirectedGraph<V,A> | 75 |
76 | Simple class that can be used to model directed graphs, where
77 | arbitrary types of data are associated with the nodes and arcs
78 | of the graph.
79 | |
80 |
| DirectedGraphArc<V,A> | 83 |
84 | Class that models arcs in the directed arcs.
85 | |
86 |
| Item | 89 |
90 | Class that models a knapsack item with a profit and a weight
91 | |
92 |
| Main | 95 |
96 | Main class for the Java/CPLEX example
97 | |
98 |
| Model | 101 |
102 | Model class that converts a directed graph representing a
103 | precedence constrained knapsack problem into a mathematical programming
104 | model managed by CPLEX.
105 | |
106 |
| Class and Description | 81 |
|---|
| DirectedGraph
85 | Simple class that can be used to model directed graphs, where
86 | arbitrary types of data are associated with the nodes and arcs
87 | of the graph.
88 | |
89 |