Pages that link to "Item:Q2268764"
From MaRDI portal
The following pages link to A tighter formulation of the \(p\)-median problem (Q2268764):
Displaying 27 items.
- Hub location problems with price sensitive demands (Q264310) (← links)
- \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis (Q337587) (← links)
- Complexity evaluation of benchmark instances for the \(p\)-median problem (Q636452) (← links)
- Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria. (Q703293) (← links)
- The directional \(p\)-median problem: definition, complexity, and algorithms (Q864030) (← links)
- Two paths location of a tree with positive or negative weights (Q896109) (← links)
- A new formulation for the conditional \(p\)-median and \(p\)-center problems (Q1003500) (← links)
- COBRA: A new formulation of the classic \(p\)-median location problem (Q1413753) (← links)
- Compact MILP formulations for the \(p\)-center problem (Q1661850) (← links)
- An improved Lagrangian relaxation and dual ascent approach to facility location problems (Q1789574) (← links)
- Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem (Q1926910) (← links)
- Multiobjective optimization on hierarchical refugee evacuation and resource allocation for disaster management (Q2007155) (← links)
- A general variable neighborhood search approach based on a \(p\)-median model for cellular manufacturing problems (Q2070119) (← links)
- An improved approximation algorithm for the prize-collecting red-blue median problem (Q2110701) (← links)
- BEAMR: an exact and approximate model for the \(p\)-median problem (Q2384887) (← links)
- Solving the \(p\)-median problem on regular and lattice networks (Q2664388) (← links)
- A comparative study of different formulations for the capacitated discrete ordered median problem (Q2664433) (← links)
- A computational study for the \(p\)-median problem (Q2883594) (← links)
- Two Paths Location of a Tree with Positive or Negative Weights (Q2942409) (← links)
- A Computational Study of the Pseudo-Boolean Approach to the p-Median Problem Applied to Cell Formation (Q3091534) (← links)
- On the Vector Assignment <i>p</i>-Median Problem (Q3823389) (← links)
- A Branch Decomposition Algorithm for the <i>p</i>-Median Problem (Q4599316) (← links)
- Discrete facility location in machine learning (Q5100135) (← links)
- On the DCJ Median Problem (Q5165613) (← links)
- New formulations for two location problems with interconnected facilities (Q6128897) (← links)
- An efficient Benders decomposition for the \(p\)-median problem (Q6167396) (← links)
- Efficient presolving methods for solving maximal covering and partial set covering location problems (Q6168589) (← links)
