Pages that link to "Item:Q5938475"

The following pages link to The maximin-maxisum network location problem (Q5938475):

Displaying 25 items.

• Improving the location of minisum facilities through network modification (Q689226) (← links)
• Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study (Q832797) (← links)
• Undesirable facility location problems on multicriteria networks (Q853902) (← links)
• A branch-and-cut method for the obnoxious \(p\)-median problem (Q926563) (← links)
• The ordered gradual covering location problem on a network (Q967440) (← links)
• Multiple criteria facility location problems: a survey (Q988401) (← links)
• The obnoxious \(p\) facility network location problem with facility interaction (Q1291604) (← links)
• The biobjective absolute center problem (Q1383313) (← links)
• The discrete p-maxian location problem (Q1824542) (← links)
• Obnoxious-facility location and data-envelopment analysis: a combined distance-based formula\-tion (Q1847216) (← links)
• A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks (Q1885943) (← links)
• Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions (Q2178373) (← links)
• Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives (Q2253362) (← links)
• The multicriteria \(p\)-facility median location problem on networks (Q2256313) (← links)
• Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network (Q2271121) (← links)
• Full ordering Voronoi sets for bi-facility bicriterium (max, sum) location on networks (Q2704993) (← links)
• Location of an Obnoxious Route (Q3033533) (← links)
• AMBULANCE SERVICE FACILITY LOCATION PROBLEM (Q3647395) (← links)
• Improving the location of minimax facilities through network modification (Q4291483) (← links)
• The collection depots location problem on networks (Q4539882) (← links)
• Equivalence of Solutions to Network Location Problems (Q4723555) (← links)
• A Parametric 1-Maximin Location Problem (Q5202832) (← links)
• Conditional Location Problems on Networks and in the Plane (Q5506724) (← links)
• The Location of Undesirable Facilities (Q5506725) (← links)
• Solving of the maxisum location problem on network with a restriction on transport costs (Q6081727) (← links)