## An algorithmic study on basic planning problems in operations research |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Introduction | 1 |

Combinatorial Models | 9 |

Greedoid and Greedy Algorithm | 27 |

3 other sections not shown

### Common terms and phrases

algorithm to solve Basic Planning Problems Branch and Bound capital budgeting chance constrained integer chance constrained programming Chapter chromosome column computational results constrained integer programming constraints CPB(bk crossover operation define denote distributive lattice Domain Specific Knowledge Dual All Integer evaluation function fa(b feasible solution fuzzy number fuzzy simulation genetic algorithm goal programming greedoid greedy algorithm input data Integer Algorithm integer linear programming Iwamura Josai University Knapsack Function Knapsack Problem Knapsack type Lemma lexicographically maximum lexicographically minimum base lexicographically optimal base linear programming matroid minimize Mutation Operation n-tuple nodes nonbasic nonnegative integer constants objective function value optimal solution parameters periodicity property pia/(pi Pk+i popsize poset poset greedoid Proof random real number randomly reliability sat(uCl Set Covering problem Set Partitioning Problem solution procedure solve the Set submodular polyhedron submodular system Theorem Traveling Salesman problem Uncertain Programming variables weight vector