Pages that link to "Item:Q2384883"

The following pages link to The minimum weighted covering location problem with distance constraints (Q2384883):

Displaying 17 items.

• Covering part of a planar network (Q291695) (← links)
• The disruptive anti-covering location problem (Q320083) (← links)
• On covering location problems on networks with edge demand (Q342492) (← links)
• Balancing the arrival times of users in a two-stage location problem (Q512992) (← links)
• An agent-based framework for modeling and solving location problems (Q610998) (← links)
• Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study (Q832797) (← links)
• Fuzzy logic based algorithms for maximum covering location problems (Q1007856) (← links)
• The Weber obnoxious facility location model: a big arc small arc approach (Q1651661) (← links)
• Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams (Q2030244) (← links)
• Conditional facility location problems with continuous demand and a polygonal barrier (Q2239930) (← links)
• The minimal covering location and sizing problem in the presence of gradual cooperative coverage (Q2242372) (← links)
• Public facility location using dispersion, population, and equity criteria (Q2514787) (← links)
• Equality measures properties for location problems (Q2629900) (← links)
• Big segment small segment global optimization algorithm on networks (Q3113501) (← links)
• Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand (Q3453339) (← links)
• The Location of Undesirable Facilities (Q5506725) (← links)
• Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming (Q6090468) (← links)