Pages that link to "Item:Q2116913"

The following pages link to Submodularity and local search approaches for maximum capture problems under generalized extreme value models (Q2116913):

Displaying 12 items.

• A branch-and-bound algorithm for the maximum capture problem with random utilities (Q322866) (← links)
• Outer approximation and submodular cuts for maximum capture facility location problems with random utilities (Q1754055) (← links)
• The maximum capture problem with heterogeneous customers (Q1819241) (← links)
• The maximum capture problem with random utilities: problem formulation and algorithms (Q1848399) (← links)
• Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems (Q2097628) (← links)
• Store location with multipurpose shopping trips and a new random utility customers' choice model (Q2098041) (← links)
• Fractional 0-1 programming and submodularity (Q2162513) (← links)
• A multicut outer-approximation approach for competitive facility location under random utilities (Q2178115) (← links)
• Joint location and cost planning in maximum capture facility location under random utilities (Q6047876) (← links)
• Sequential customers' decisions in facility location with comparison-shopping (Q6065653) (← links)
• Improved approximation algorithms for \(k\)-submodular maximization under a knapsack constraint (Q6065659) (← links)
• The follower competitive facility location problem under the nested logit choice rule (Q6168505) (← links)