Normal view MARC view ISBD view

New algorithms for constrained rectangular guillotine knapsack problems [thesis] / K V Viswanathan

By:

Viswanathan, K V

Contributor(s):

Sarkar, B [Guide & Chairperson DPR]

Material type: Text

TextPublication details: Calcutta : IIM Calcutta, 1988Description: 303p. ; 30cmSubject(s):

Operations management

DDC classification:

658.5 VIS

Dissertation note: Fellow in Management 1988 IIM Calcutta Summary: The main focus of this work is the Constrained Rectangular Guillotine Knapsack Problem, and a new algorithm that yields optimal solutions is presented. This algorithm is seen to be very efficient in comparison with existing algorithms for solving the problem. Further it is also shown that proposed algorithm can handle a much wider range of constraints than the best known existing algorithm. Computational experience on a wide range of test problems has also been presented.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Status	Date due	Barcode	Item holds
Book	Calcutta	658.5 VIS (Browse shelf(Opens below))	Available		IIMC-TH32

Total holds: 0

Browsing Calcutta shelves Close shelf browser (Hides shelf browser)

Previous			No cover image available	No cover image available			No cover image available	Next
Previous	658.5 TUR Implementing concurrent project management	658.5 VAN Operations strategy :	658.5 VEN Queuing and other related approaches to cash management	658.5 VIS New algorithms for constrained rectangular guillotine knapsack problems	658.5 VOG Demand fulfillment in multi-stage customer hierarchies	658.5 VOI Supply chain coordination in case of asymmetric information :	658.5 VOR Production control :	Next

Fellow in Management 1988 IIM Calcutta

The main focus of this work is the Constrained Rectangular Guillotine Knapsack Problem, and a new algorithm that yields optimal solutions is presented. This algorithm is seen to be very efficient in comparison with existing algorithms for solving the problem. Further it is also shown that proposed algorithm can handle a much wider range of constraints than the best known existing algorithm. Computational experience on a wide range of test problems has also been presented.

There are no comments on this title.

to post a comment.