An efficient branch and bound algorithm for the capacitated warehouse location problem View on Open Library

An efficient branch and bound algorithm for the capacitated warehouse location problem

by Basheer M. Khumawala

No reviews yet
First published: 1974 1 language
Subjects
Branch and bound algorithms Integer programming Location Warehouses

Reviews

Log in or sign up to write a review.

No reviews yet. Be the first!

More by Basheer M. Khumawala

Algorithm for the P-median problem with maximum distance constraints

Algorithm for the P-median problem with ...

An efficient algorithm for central facilities location

An efficient algorithm for central facil...

An efficient heuristic algorithm for the warehouse location problem

An efficient heuristic algorithm for the...

An efficient heuristic procedure for the capacitated warehouse location problem

An efficient heuristic procedure for the...

An improved method for solving the segregated storage problem

An improved method for solving the segre...

A branch and bound algorithm for assembly line balancing with paralleling

A branch and bound algorithm for assembl...

You Might Also Like

More in Branch and bound alg...
Branch-and-bound strategies for dynamic programming

Branch-and-bound strategies for dynamic ...

Thomas L. Morin
Automatic verification of sequential infinite-state processes

Automatic verification of sequential inf...

Olaf Burkart
Results of the synthesis of optimal networks of AND and OR gates for four-variable switching functions by a branch-and-bound computer program

Results of the synthesis of optimal netw...

Jay Culliney
Optimizing binary trees grown with a sorting algorithm

Optimizing binary trees grown with a sor...

William A Martin
Pruning and branching methods for designing optimal networks by the branch-and-bound method

Pruning and branching methods for design...

Tomoyasu Nakagawa
Branch and bound methods for combinatorial problems

Branch and bound methods for combinatori...

John D. C. Little