0-1 Programming Menentukan Shortest Path yang Memenuhi Kendala

Abstract

This article studies about applying of 0-1 Programmings in looking for a shortest path constraint which is problem knapsack in the network. Problem that is often emerges in this network for example to look for shortest path with cost constraint which has been budgeted from source of s to purpose t. At this problem optimal solution will show possibility that best choice and implementation by a program using LINDO.