Pages that link to "Item:Q3856429"
From MaRDI portal
The following pages link to A Dual-Based Procedure for Uncapacitated Facility Location (Q3856429):
Displaying 50 items.
- Multi-level facility location as the maximization of a submodular set function (Q320143) (← links)
- Models and algorithms for network reduction (Q320811) (← links)
- Tactical network planning for food aid distribution in Kenya (Q337453) (← links)
- \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis (Q337587) (← links)
- Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items (Q342353) (← links)
- Optimal Physician assignment and patient demand allocation in an outpatient care network (Q342387) (← links)
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem (Q434153) (← links)
- An exact cooperative method for the uncapacitated facility location problem (Q495932) (← links)
- New local searches for solving the multi-source Weber problem (Q512988) (← links)
- A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand (Q519091) (← links)
- An homage to Joseph-Louis Lagrange and Pierre Huard (Q537596) (← links)
- Dual ascent: variations of a theme (Q537601) (← links)
- Online facility location with facility movements (Q539473) (← links)
- A computational comparison of several formulations for the multi-period incremental service facility location problem (Q610997) (← links)
- Forecast horizons and dynamic facility location planning (Q689237) (← links)
- A simple and deterministic competitive algorithm for online facility location (Q703850) (← links)
- A simple tabu search for warehouse location (Q703910) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing (Q750288) (← links)
- Network production-location problems under price uncertainty (Q788616) (← links)
- A branch-and-bound algorithm for the multi-level uncapacitated facility location problem (Q795714) (← links)
- Using a facility location algorithm to solve large set covering problems (Q796457) (← links)
- Solving capacitated clustering problems (Q799059) (← links)
- The zone-constrained location problem on a network (Q809885) (← links)
- A comparison of heuristics and relaxations for the capacitated plant location problem (Q811347) (← links)
- An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type (Q811349) (← links)
- An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure (Q816402) (← links)
- The stochastic location-assignment problem on a tree (Q816410) (← links)
- A conditional \(p\)-hub location problem with attraction functions (Q833528) (← links)
- A facility location model for logistics systems including reverse flows: the case of remanufacturing activities (Q850279) (← links)
- Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort (Q856273) (← links)
- Efficient primal-dual heuristic for a dynamic location problem (Q858286) (← links)
- A note on duality gap in the simple plant location problem (Q858326) (← links)
- A hybrid multistart heuristic for the uncapacitated facility location problem (Q858329) (← links)
- An exact solution procedure for a cluster hub location problem (Q859914) (← links)
- The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
- The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation (Q864015) (← links)
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique (Q864018) (← links)
- Lower bounds for the two-stage uncapacitated facility location problem (Q864032) (← links)
- New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach (Q890005) (← links)
- On a class of subadditive duals for the uncapacitated facility location problem (Q902981) (← links)
- A Lagrangean dual ascent algorithm for simple plant location problems (Q911446) (← links)
- A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem (Q911484) (← links)
- A projection method for the uncapacitated facility location problem (Q918404) (← links)
- The general optimal market area model (Q919999) (← links)
- A method for solving to optimality uncapacitated location problems (Q920004) (← links)
- Discrete facility location with nonlinear diseconomies in fixed costs (Q920006) (← links)
- Models for multimode multicommodity location problems with interdepot balancing requirements (Q920012) (← links)
- A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand (Q949496) (← links)
- A dynamic location problem with maximum decreasing capacities (Q953304) (← links)