Pages that link to "Item:Q4021782"

The following pages link to Optimal Location of Discretionary Service Facilities (Q4021782):

Displaying 38 items.

• Optimal deployment of alternative fueling stations on transportation networks considering deviation paths (Q301092) (← links)
• A branch and price approach for routing and refueling station location model (Q320784) (← links)
• Battery swap station location-routing problem with capacitated electric vehicles (Q337428) (← links)
• A continuous network location problem for a single refueling station on a tree (Q337663) (← links)
• A generalized model for locating facilities on a network with flow-based demand (Q613557) (← links)
• Integer programming models for deployment of airport baggage screening security devices (Q833390) (← links)
• Flow intercepting facility location: Problems, models and heuristics (Q841607) (← links)
• Bi-level programming model and hybrid genetic algorithm for flow interception problem with customer choice (Q971769) (← links)
• A Lagrangian relaxation approach to large-scale flow interception problems (Q1026763) (← links)
• Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada (Q1268426) (← links)
• Locating flow-capturing units on a network with multi-counting and diminishing returns to scale (Q1278239) (← links)
• The \(p\) maximal cover -- \(p\) partial center problem on networks (Q1317171) (← links)
• Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm (Q1652448) (← links)
• Evasive flow capture: a multi-period stochastic facility location problem with independent demand (Q1752853) (← links)
• Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem (Q1772870) (← links)
• Performance analysis and optimization of web proxy servers and mirror sites (Q1848375) (← links)
• Solving the competitive discretionary service facility location problem (Q1869391) (← links)
• Locating flow-intercepting facilities: New approaches and results (Q1908283) (← links)
• Online budgeted maximum coverage (Q1979466) (← links)
• Locomotive fuel management with inline refueling (Q2030358) (← links)
• Pessimistic evasive flow capturing problems (Q2030509) (← links)
• A Benders decomposition algorithm for the maximum availability service facility location problem (Q2108127) (← links)
• A lexicographic optimization approach to the deviation-flow refueling station location problem on a general network (Q2119751) (← links)
• Relief aid provision to en route refugees: multi-period mobile facility location with mobile demand (Q2140220) (← links)
• Distributions of rectilinear deviation distance to visit a facility (Q2270299) (← links)
• The electric vehicle shortest-walk problem with battery exchanges (Q2357868) (← links)
• Capacitated refueling station location problem with traffic deviations over multiple time periods (Q2358103) (← links)
• Location of alternative-fuel stations using the flow-refueling location model and dispersion of candidate sites on arcs (Q2642504) (← links)
• Heuristic algorithms for siting alternative-fuel stations using the flow-refueling location model (Q2654319) (← links)
• On the analysis of an idealized model to manage gasoline supplies in a short-notice hurricane evacuation (Q2676272) (← links)
• (Q4488781) (← links)
• Exact Solution of the Evasive Flow Capturing Problem (Q5131542) (← links)
• (Q5859936) (← links)
• (Q5859937) (← links)
• An edge scanning method for the continuous deviation‐flow refueling station location problem on a general network (Q6065885) (← links)
• A hybrid solution method for the bi-objective traffic counting location problem using previous origin-destination trip tables (Q6088551) (← links)
• Location Science in Canada (Q6102878) (← links)
• Solution Methods for Fuel Supply of Trains (Q6160380) (← links)