Pages that link to "Item:Q1413748"

The following pages link to An improved branch \& bound method for the uncapacitated competitive location problem (Q1413748):

Displaying 11 items.

• A Lagrangian heuristic algorithm for a public healthcare facility location problem (Q363567) (← links)
• Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (Q408438) (← links)
• A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints (Q761340) (← links)
• A robust and efficient algorithm for planar competitive location problems (Q1026588) (← links)
• Maximization of submodular functions: theory and enumeration algorithms (Q1027590) (← links)
• Solving the multiple competitive facilities location problem (Q1847246) (← links)
• Competitive location and pricing on networks with random utilities (Q2357929) (← links)
• A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem (Q2569153) (← links)
• An upper bound for the competitive location and capacity choice problem with multiple demand scenarios (Q5374006) (← links)
• Conditional Location Problems on Networks and in the Plane (Q5506724) (← links)
• Constraint generation approaches for submodular function maximization leveraging graph properties (Q6154401) (← links)