Pages that link to "Item:Q1804069"
From MaRDI portal
The following pages link to Lagrangean heuristics for location problems (Q1804069):
Displaying 50 items.
- Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
- On statistical bounds of heuristic solutions to location problems (Q281793) (← links)
- Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem (Q322911) (← links)
- Solving a dynamic facility location problem with partial closing and reopening (Q342268) (← links)
- An exact cooperative method for the uncapacitated facility location problem (Q495932) (← links)
- Observations on some heuristic methods for the capacitated facility location problem (Q505112) (← links)
- A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand (Q519091) (← links)
- A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations (Q657059) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- Confidence in heuristic solutions? (Q746822) (← links)
- A continuous location-allocation problem with zone-dependent fixed cost (Q816411) (← links)
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- A cutting plane algorithm for the capacitated facility location problem (Q842775) (← links)
- Developing effective meta-heuristics for a probabilistic location model via experimental design (Q856202) (← links)
- Efficient primal-dual heuristic for a dynamic location problem (Q858286) (← links)
- A hybrid multistart heuristic for the uncapacitated facility location problem (Q858329) (← links)
- A multiobjective evolutionary approach for linearly constrained project selection under uncertainty (Q864003) (← links)
- The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
- A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
- A perturbation-based heuristic for the capacitated multisource Weber problem (Q864040) (← links)
- Computational study of large-scale \(p\)-median problems (Q868446) (← links)
- On a class of subadditive duals for the uncapacitated facility location problem (Q902981) (← links)
- Scatter search for the single source capacitated facility location problem (Q940848) (← links)
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987) (← links)
- Maximization of submodular functions: theory and enumeration algorithms (Q1027590) (← links)
- Resource-constrained management of heterogeneous assets with stochastic deterioration (Q1042122) (← links)
- An effective heuristic for large-scale capacitated facility location problems (Q1044245) (← links)
- An exact algorithm for the capacitated facility location problems with single sourcing (Q1124811) (← links)
- A Langrangean heuristic for the \(p_ k\)-median dynamic location problem (Q1194737) (← links)
- Massively parallel analog tabu search using neural networks applied to simple plant location problems (Q1268165) (← links)
- A tree search algorithm for the crew scheduling problem (Q1278340) (← links)
- A Lagrangean heuristic for the facility location problem with staircase costs (Q1278582) (← links)
- Driving tabu search with case-based reasoning (Q1280158) (← links)
- Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem (Q1290717) (← links)
- Designing reliable tree networks with two cable technologies (Q1291775) (← links)
- Optimal political districting (Q1360126) (← links)
- A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution. (Q1406697) (← links)
- Upper and lower bounds for the single source capacitated location problem. (Q1410616) (← links)
- Branch and peg algorithms for the simple plant location problem. (Q1423442) (← links)
- Resource planning and a depot location model for electric power restoration. (Q1428043) (← links)
- A multiperiod two-echelon multicommodity capacitated plant location problem (Q1569931) (← links)
- An exact method for the two-echelon, single-source, capacitated facility location problem (Q1572966) (← links)
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem (Q1584797) (← links)
- A repeated matching heuristic for the single-source capacitated facility location problem (Q1610126) (← links)
- A Lagrangian search method for the \(P\)-median problem (Q1675643) (← links)
- A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem (Q1695027) (← links)
- A computational study of a nonlinear minsum facility location problem (Q1761206) (← links)
- Fast bounding procedures for large instances of the simple plant location problem (Q1762067) (← links)
- An aggregation heuristic for large scale p-median problem (Q1762151) (← links)
- Branch and peg algorithms for the simple plant location problem (Q1765536) (← links)
