Pages that link to "Item:Q2379654"

The following pages link to The network \(p\)-median problem with discrete probabilistic demand weights (Q2379654):

Displaying 14 items.

• A model for locating park-and-ride facilities on urban networks based on maximizing flow capture: a case study of Isfahan, Iran (Q264250) (← links)
• The reliable \(p\)-median problem with at-facility service (Q319654) (← links)
• The inverse 1-median problem on tree networks with variable real edge lengths (Q460433) (← links)
• Solving the median problem with continuous demand on a network (Q2636614) (← links)
• Maximum probability O-D matrix estimation in large-sized networks (Q3389550) (← links)
• The most probable allocation solution for the p-median problem (Q3389552) (← links)
• (Q3389573) (← links)
• The β-Reliable Median on a Network with Discrete Probabilistic Demand Weights (Q3392128) (← links)
• The probabilistic 1-maximal covering problem on a network with discrete demand weights (Q3612205) (← links)
• NP-Hard, Capacitated, Balanced <i>p</i>-Median Problems on a Chain Graph with a Continuum of Link Demands (Q3796941) (← links)
• A SOLUTION ALGORITHM FOR p-MEDIAN LOCATION PROBLEM ON UNCERTAIN RANDOM NETWORKS (Q5009369) (← links)
• The 1-Median And 1-Antimedian Problems With Continuous Probabilistic Demand Weights (Q6043235) (← links)
• The multifacility center problems with random demand weights (Q6065899) (← links)
• Solving the 1-median problem on a network with continuous demand and demand surplus (Q6068730) (← links)