Pages that link to "Item:Q5246830"

The following pages link to Matheuristics for the capacitated p‐median problem (Q5246830):

Displaying 16 items.

• A column generation approach to capacitated \(p\)-median problems (Q1433151) (← links)
• The matching relaxation for a class of generalized set partitioning problems (Q1634772) (← links)
• An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty (Q1652700) (← links)
• Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities (Q1730613) (← links)
• The capacitated mobile facility location problem (Q1737488) (← links)
• Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources (Q1753460) (← links)
• Hybrid genetic algorithms with selective crossover for the capacitated \(p\)-Median problem (Q1788935) (← links)
• A matheuristic for large-scale capacitated clustering (Q2668749) (← links)
• Efficient Algorithms for the Capacitated 1-Median Problem (Q4024313) (← links)
• Discrete facility location in machine learning (Q5100135) (← links)
• An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs (Q5106386) (← links)
• (Q5696416) (← links)
• A matheuristic for the MinMax capacitated open vehicle routing problem (Q6066715) (← links)
• A review of mathematical optimization models applied to the sugarcane supply chain (Q6079926) (← links)
• Solving the bi‐objective capacitated <i>p</i>‐median problem with multilevel capacities using compromise programming and VNS (Q6088248) (← links)
• An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach (Q6160968) (← links)