An Algorithmic Study on Basic Planning Problems in Operations Research |
Common terms and phrases
A₁ algorithm to solve b₁ Basic Planning Problems Branch and Bound c₁ chance constrained goal chance constrained integer chance constrained programming chromosome column Combinatorial constrained goal programming constrained integer programming constraints crossover operation d₁ d₂ denote density distributive lattice Domain Specific Knowledge fa(b feasible chromosome feasible solution fuzzy number fuzzy simulation genetic algorithm goal programming greedoid greedy algorithm input data integer programming Japanese Josai University K.Iwamura Knapsack Function Knapsack Problem Lemma lexicographically maximum base lexicographically optimal base linear programming link topology matroid minimize Mutation Operation n-tuple nodes nonnegative integers NP-complete objective function value Operations Research Society optimal solution Partitioning Problem Pk+1 poset poset greedoid priority programming with fuzzy random real number randomly S₁ sat(uc sat(x Set Covering problem Set Partitioning Problem solve the Set Step submodular polyhedron submodular system subset tableau Theorem Uncertain Programming V₁ variables weight vector