Pages that link to "Item:Q2422923"

The following pages link to Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences (Q2422923):

Displaying 10 items.

• New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm (Q2176276) (← links)
• On location-allocation problems for dimensional facilities (Q2317850) (← links)
• A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences (Q2664416) (← links)
• Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
• Metaheuristics for bilevel optimization: a comprehensive review (Q6065604) (← links)
• Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem (Q6065606) (← links)
• Revisiting Stackelberg p-median problem with user preferences (Q6065620) (← links)
• Dynamically second-preferred \(p\)-center problem (Q6106963) (← links)
• A facility location problem for extracurricular workshop planning: bi-level model and metaheuristics (Q6561618) (← links)
• A logistics provider's profit maximization facility location problem with random utility maximizing followers (Q6568468) (← links)