Pages that link to "Item:Q2643785"

The following pages link to A strengthened formulation for the simple plant location problem with order (Q2643785):

Displaying 27 items.

• The maximin HAZMAT routing problem (Q299771) (← links)
• Closest assignment constraints in discrete location problems (Q439609) (← links)
• Randomized local search for the discrete competitive facility location problem (Q463379) (← links)
• Discrete location for bundled demand points (Q611011) (← links)
• Single-allocation ordered median hub location problems (Q709204) (← links)
• A comparison of formulations and solution methods for the minimum-envy location problem (Q1000990) (← links)
• A flexible model and efficient solution strategies for discrete location problems (Q1028444) (← links)
• Cut generation algorithm for the discrete competitive facility location problem (Q1673703) (← links)
• Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm (Q1718374) (← links)
• The rank pricing problem: models and branch-and-cut algorithms (Q1722958) (← links)
• Approximation of the competitive facility location problem with MIPs (Q1725607) (← links)
• The double-assignment plant location problem with co-location (Q2026959) (← links)
• Robust strategic planning for mobile medical units with steerable and unsteerable demands (Q2239842) (← links)
• The rank pricing problem with ties (Q2239986) (← links)
• \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario (Q2308185) (← links)
• An extended covering model for flexible discrete and equity location problems (Q2379187) (← links)
• Facility location under service level constraints for heterogeneous customers (Q2399319) (← links)
• Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences (Q2422923) (← links)
• A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences (Q2664416) (← links)
• Product line optimization with multiples sites (Q2676378) (← links)
• Metaheuristic methods for solving the Bilevel Uncapacitated Facility Location Problem with Clients' Preferences (Q2840751) (← links)
• A Cut Generation Algorithm of Finding an Optimal Solution in a Market Competition (Q4973247) (← links)
• Discrete facility location in machine learning (Q5100135) (← links)
• Computational complexity of the discrete competitive facility location problem (Q5264752) (← links)
• Revisiting Stackelberg p-median problem with user preferences (Q6065620) (← links)
• Dynamically second-preferred \(p\)-center problem (Q6106963) (← links)
• The joint impact of environmental awareness and system infrastructure on e-waste collection (Q6168500) (← links)