✦ LIBER ✦

Finding efficient solutions for rectilinear distance location problems efficiently

✍ Scribed by Luc G. Chalmet; Richard L. Francis; Antoon Kolen

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 881 KB
Volume: 6
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(81)90197-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding integer efficient solutions for

Finding integer efficient solutions for multiple objective network programming problems

✍ Minghe Sun 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 406 KB

A direct approach for finding all effici

A direct approach for finding all efficient solutions for multiobjective programming problems

✍ Ebrahim A. Youness 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 248 KB

Efficient solutions schemes for interfac

Efficient solutions schemes for interface problems

✍ J. Fish; M. Pandheeradi; V. Belsky 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 868 KB

An efficient heuristic procedure for the

An efficient heuristic procedure for the uncapacitated warehouse location problem

✍ Basheer M. Khumawala 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 681 KB

An efficient heuristic procedure for the

An efficient heuristic procedure for the uncapacitated warehouse location problem

✍ Basheer M. Khumawala 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 681 KB

## Abstract This paper introduces an efficient heuristic procedure for a special class of mixed integer programming problems called the uncapacitated warehouse (plant) location problem. This procedure is derived from the branching decision rules proposed for the branch and bound algorithm by the au

An efficient heuristic procedure for the

An efficient heuristic procedure for the capacitated warehouse location problem

✍ Basheer M. Khumawala 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 652 KB