Pages that link to "Item:Q1058960"
From MaRDI portal
The following pages link to A comparison of two dual-based procedures for solving the p-median problem (Q1058960):
Displaying 26 items.
- \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis (Q337587) (← links)
- Fast modified global \(k\)-means algorithm for incremental cluster construction (Q621088) (← links)
- A network location-allocation model trading off flow capturing and \(p\)- median objectives (Q689248) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation (Q863991) (← links)
- A method for solving to optimality uncapacitated location problems (Q920004) (← links)
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems (Q936447) (← links)
- Optimal partitioning of a data set based on the \(p\)-median model (Q946677) (← links)
- A computational evaluation of a general branch-and-price framework for capacitated network location problems (Q1026595) (← links)
- Exemplar-based clustering via simulated annealing (Q1036142) (← links)
- On the exact solution of large-scale simple plant location problems (Q1121152) (← links)
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem (Q1271380) (← links)
- Analyzing tradeoffs between zonal constraints and accessibility in facility location (Q1317094) (← links)
- Integer programming formulations of discrete hub location problems (Q1317166) (← links)
- Cluster analysis and mathematical programming (Q1365055) (← links)
- Solving the anti-covering location problem using Lagrangian relaxation (Q1373891) (← links)
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder) (Q1433467) (← links)
- An improved Lagrangian relaxation and dual ascent approach to facility location problems (Q1789574) (← links)
- Lagrangean heuristics for location problems (Q1804069) (← links)
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems (Q2018474) (← links)
- BEAMR: an exact and approximate model for the \(p\)-median problem (Q2384887) (← links)
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems (Q2572256) (← links)
- An algorithm for minimizing clustering functions (Q5317732) (← links)
- Heuristics for Location Models (Q5506730) (← links)
- Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems (Q5506732) (← links)
- Affinity propagation and uncapacitated facility location problems (Q5964469) (← links)
