Pages that link to "Item:Q960382"

The following pages link to The multi-period incremental service facility location problem (Q960382):

Displaying 24 items.

• A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (Q296861) (← links)
• Location and reorganization problems: the Calabrian health care system case (Q322592) (← links)
• Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty (Q336654) (← links)
• Modelling and planning public cultural schedules for efficient use of resources (Q337501) (← links)
• A branch and price algorithm for the pharmacy duty scheduling problem (Q342397) (← links)
• Multiperiod location-routing with decoupled time scales (Q439365) (← links)
• Continuous location under the effect of `refraction' (Q507312) (← links)
• A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method (Q526844) (← links)
• The single period coverage facility location problem: Lagrangean heuristic and column generation approaches (Q610996) (← links)
• A computational comparison of several formulations for the multi-period incremental service facility location problem (Q610997) (← links)
• On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems (Q721958) (← links)
• Modeling and solving a logging camp location problem (Q748565) (← links)
• On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon (Q1688448) (← links)
• OR models in urban service facility location: a critical review of applications and future developments (Q1728469) (← links)
• The incremental cooperative design of preventive healthcare networks (Q1730637) (← links)
• New models for the location of controversial facilities: a bilevel programming approach (Q1738822) (← links)
• Evasive flow capture: a multi-period stochastic facility location problem with independent demand (Q1752853) (← links)
• The incremental connected facility location problem (Q2329719) (← links)
• Ordered \(p\)-median problems with neighbourhoods (Q2419559) (← links)
• Modeling and solution of maximal covering problem considering gradual coverage with variable radius over multi-periods (Q4634322) (← links)
• Simple dynamic location problem with uncertainty: a primal-dual heuristic approach (Q5746680) (← links)
• The value of the multi-period solution revisited: when to model time in capacitated location problems (Q6065619) (← links)
• Accelerated Benders decomposition and local branching for dynamic maximum covering location problems (Q6568492) (← links)
• Comparing the solvers for the mixed integer linear programming problems and the software environments that call them (Q6648336) (← links)