Location of connection facilities.

MaRDI QIDQ3510494zbMATH OpenFDO

Authors Martin Bischoff

Publication date 3 July 2008

Full work available at URL http://www.shaker.de/de/content/catalogue/index.asp?lang=de&ID=8&ISBN=978-3-8322-7096-4

zbMATH Keywords

allocationlocationnetwork flow assignmenttransportation

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Discrete location and assignment (90B80) Continuous location (90B85) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Construction Line Algorithms for the Connection Location-Allocation Problem
• The \(K\)-connection location problem in a plane
• A squared-euclidean distance location-allocation problem
• Allocation search methods for a generalized class of location-allocation problems
• The multi-facility location-allocation problem with polyhedral barriers

Cited in

(5)

• Allocation search methods for a generalized class of location-allocation problems
• Mathematical models for selection of optimal place and size of connections considering the time-value of money
• On location-allocation problems for dimensional facilities
• scientific article; zbMATH DE number 1882349 (Why is no real title available?)
• The \(K\)-connection location problem in a plane

This page was built for publication: Location of connection facilities.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3510494)