Pages that link to "Item:Q3335476"

The following pages link to The p-Centre Problem-Heuristic and Optimal Algorithms (Q3335476):

Displaying 39 items.

• An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem (Q342496) (← links)
• Drezner's exact method for the continuous \(p\)-centre problem revisited (Q510920) (← links)
• Maximizing the minimum cover probability by emergency facilities (Q512997) (← links)
• The multiple-robot assembly plan problem (Q685191) (← links)
• On weighted rectilinear 2-center and 3-center problems (Q757236) (← links)
• A simple heuristic for the p-centre problem (Q761233) (← links)
• A note on the m-center problem with rectilinear distances (Q913636) (← links)
• A new bounding method for single facility location models (Q920023) (← links)
• New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems (Q959511) (← links)
• A robust and efficient algorithm for planar competitive location problems (Q1026588) (← links)
• The p-cover problem (Q1079475) (← links)
• A heuristic for the p-center problem in graphs (Q1098862) (← links)
• The slab dividing approach to solve the Euclidean \(P\)-center problem (Q1207325) (← links)
• Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance (Q1208455) (← links)
• A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem (Q1291662) (← links)
• Lexicographic local search and the \(p\)-center problem. (Q1410610) (← links)
• The mixed center location problem (Q1631666) (← links)
• The connected disk covering problem (Q1702836) (← links)
• \(k\)-balanced center location problem: a new multi-objective facility location problem (Q1722964) (← links)
• Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane (Q1752856) (← links)
• Dominant, an algorithm for the \(p\)-center problem. (Q1811146) (← links)
• Heuristic methods and applications: A categorized survey (Q1823879) (← links)
• On the conditional \(p\)-median problem (Q1894727) (← links)
• An elliptical cover problem in drone delivery network design and its solution algorithms (Q2079395) (← links)
• Optimal covering points and curves (Q2126961) (← links)
• Solving multiple facilities location problems with separated clusters (Q2294344) (← links)
• Solving \(k\)-center problems involving sets based on optimization techniques (Q2301186) (← links)
• The searching over separators strategy to solve some NP-hard problems in subexponential time (Q2366228) (← links)
• The minimum equitable radius location problem with continuous demand (Q2378371) (← links)
• The discrete and mixed minimax 2-center problems (Q2424880) (← links)
• The 1-center problem in the plane with independent random weights (Q2456633) (← links)
• The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory (Q2629705) (← links)
• Topological stability of kinetic \(k\)-centers (Q2662690) (← links)
• Continuous maximal covering location problems with interconnected facilities (Q2668753) (← links)
• Rectilinear <i>m</i> -Center problem (Q3035110) (← links)
• Insertion heuristics for central cycle problems (Q3057168) (← links)
• Solving the<i>p</i>-Center problem with Tabu Search and Variable Neighborhood Search (Q4422624) (← links)
• Facility location with dynamic distance functions (Q5054838) (← links)
• A faster algorithm for the constrained minimum covering circle problem to expedite solving <i>p</i>‐center problems in an irregularly shaped area with holes (Q6053130) (← links)