✦ LIBER ✦

Some heuristic methods for solving p-median problems with a coverage constraint

✍ Scribed by Jesús Sáez-Aguado; Paula Camelia Trandafir

Book ID: 113584069
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 288 KB
Volume: 220
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2012.02.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A MORE EFFICIENT HEURISTIC FOR SOLVING L

A MORE EFFICIENT HEURISTIC FOR SOLVING LARGE P-MEDIAN PROBLEMS

✍ Paul J. Densham; Gerard Rushton 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 602 KB

A new heuristic for solving the p-median

A new heuristic for solving the p-median problem in the plane

✍ Brimberg, Jack; Drezner, Zvi 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 254 KB

Results of a New Approach to Solving the

Results of a New Approach to Solving the p-Median Problem with Maximum Distance Constraints

✍ Richard L. Church; Michael E. Meadows 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 612 KB

A Tabu Search Heuristic Procedure for So

A Tabu Search Heuristic Procedure for Solving the Transportation Problem with Exclusionary Side Constraints

✍ Minghe Sun 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 155 KB

Support method for solving a linear-quad

Support method for solving a linear-quadratic problem with polythedral with polyhedral constraints on control

✍ Bibi, M.O. 📂 Article 📅 1996 🏛 Taylor and Francis Group 🌐 English ⚖ 326 KB

Variations on a cutting plane method for

Variations on a cutting plane method for solving concave minimization problems with linear constraints

✍ A. Victor Cabot 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 534 KB

## Abstract A cutting plane method for solving concave minimization problems with linear constraints has been advanced by Tui. The principle behind this cutting plane has been applied to integer programming by Balas, Young, Glover, and others under the name of convexity cuts. This paper relates th