Pages that link to "Item:Q3386776"

The following pages link to Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem (Q3386776):

Displaying 13 items.

• Lagrangean duals and exact solution to the capacitated \(p\)-center problem (Q1044136) (← links)
• The stratified \(p\)-center problem (Q2003436) (← links)
• Minimax models for capacitated \(p\)-center problem in uncertain environment (Q2052930) (← links)
• Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants (Q2108113) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
• An exact algorithm for the capacitated vertex \(p\)-center problem (Q2496034) (← links)
• An exact framework for the discrete parallel machine scheduling location problem (Q2668759) (← links)
• The multi-period \(p\)-center problem with time-dependent travel times (Q2669591) (← links)
• A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem (Q2673558) (← links)
• Large-scale local search heuristics for the capacitated vertex<i>p</i>-center problem (Q4474299) (← links)
• The capacitated single-source p-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique (Q4987796) (← links)
• Dynamically second-preferred \(p\)-center problem (Q6106963) (← links)
• A constructive heuristic for the uniform capacitated vertex \(k\)-center problem (Q6579775) (← links)