Pages that link to "Item:Q2890410"

The following pages link to A new formulation and resolution method for the \(p\)-center problem (Q2890410):

Displaying 50 items.

• Capacitated \(p\)-center problem with failure foresight (Q319964) (← links)
• Double bound method for solving the \(p\)-center location problem (Q336682) (← links)
• Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent (Q337640) (← links)
• When centers can fail: a close second opportunity (Q337641) (← links)
• The ordered capacitated facility location problem (Q611009) (← links)
• Single-allocation ordered median hub location problems (Q709204) (← links)
• Enhancements to two exact algorithms for solving the vertex \(P\)-center problem (Q814956) (← links)
• Heuristic procedures for solving the discrete ordered median problem (Q816415) (← links)
• Solving haplotyping inference parsimony problem using a new basic polynomial formulation (Q929154) (← links)
• New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems (Q959511) (← links)
• A relaxation-based algorithm for solving the conditional \(p\)-center problem (Q974996) (← links)
• A new formulation for the conditional \(p\)-median and \(p\)-center problems (Q1003500) (← links)
• A flexible model and efficient solution strategies for discrete location problems (Q1028444) (← links)
• Distribution systems design with role dependent objectives (Q1039797) (← links)
• Lagrangean duals and exact solution to the capacitated \(p\)-center problem (Q1044136) (← links)
• A \(p\)-center grid-positioning aggregation procedure (Q1304506) (← links)
• Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem (Q1628040) (← links)
• The mixed center location problem (Q1631666) (← links)
• A scalable exact algorithm for the vertex \(p\)-center problem (Q1634076) (← links)
• A revised variable neighborhood search for the discrete ordered median problem (Q1634286) (← links)
• Compact MILP formulations for the \(p\)-center problem (Q1661850) (← links)
• Optimization problems with flexible objectives: a general modeling approach and applications (Q1698885) (← links)
• Exact approaches for solving a covering problem with capacitated subtrees (Q1722966) (← links)
• GRASP and VNS for solving the \(p\)-next center problem (Q1725619) (← links)
• An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation (Q1728503) (← links)
• A new compact formulation for the discrete \(p\)-dispersion problem (Q1752169) (← links)
• Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane (Q1752856) (← links)
• A combined facility location and network design problem with multi-type of capacitated links (Q1788754) (← links)
• The stratified \(p\)-center problem (Q2003436) (← links)
• Less is more approach in optimization: a road to artificial intelligence (Q2070138) (← links)
• A branch-and-price approach for the continuous multifacility monotone ordered median problem (Q2106721) (← links)
• Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants (Q2108113) (← links)
• A fresh view on the discrete ordered median problem based on partial monotonicity (Q2189878) (← links)
• A robust \(p\)-center problem under pressure to locate shelters in wildfire context (Q2195562) (← links)
• Alternative formulations for the obnoxious \(p\)-median problem (Q2217491) (← links)
• The complete vertex \(p\)-center problem (Q2219518) (← links)
• A dual bounding scheme for a territory design problem (Q2257364) (← links)
• A tighter formulation of the \(p\)-median problem (Q2268764) (← links)
• Improving fairness in ambulance planning by time sharing (Q2327642) (← links)
• A multi-objective integrated facility location-hardening model: analyzing the pre- and post-disruption tradeoff (Q2514827) (← links)
• A comparative study of different formulations for the capacitated discrete ordered median problem (Q2664433) (← links)
• A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem (Q2673558) (← links)
• Un nuevo resultado sobre la complejidad del problema delP-centro (Q3035114) (← links)
• Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem (Q3386776) (← links)
• On the Solution Value of the Continuous <i>p</i>-Center Location Problem on a Graph (Q3758534) (← links)
• Location of Emergency Facilities with Uncertainty in the Demands (Q4555566) (← links)
• Data Exploration by Representative Region Selection: Axioms and Convergence (Q4958552) (← links)
• (Q5051496) (← links)
• Discrete self-organizing migration algorithm and p-location problems (Q5147667) (← links)
• Discrete Center Problems (Q5506720) (← links)