Lagrangean heuristics for location problems
From MaRDI portal
Publication:1804069
Recommendations
- Heuristicas de descomposicion lagrangiana para algunos problemas de localizacion discreta
- A Lagrangean heuristic for the facility location problem with staircase costs
- Lagrangean heuristics applied to a variety of large capacitated plant location problems
- A Lagrangean heuristic for the maximal covering location problem
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
Cites work
- scientific article; zbMATH DE number 4121754 (Why is no real title available?)
- A Cross Decomposition Algorithm for Capacitated Facility Location
- A Dual-Based Add Heuristic for Uncapacitated Facility Location
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Dual-Bounded Algorithm for the p-Median Problem
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- A Lagrangean dual ascent algorithm for simple plant location problems
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- A comparison of heuristics and relaxations for the capacitated plant location problem
- A comparison of two dual-based procedures for solving the p-median problem
- A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem
- A heuristic Lagrangean algorithm for the capacitated plant location problem - A comment
- A heuristic lagrangean algorithm for the capacitated plant location problem
- A method for solving to optimality uncapacitated location problems
- A new Lagrangian relaxation approach to the generalized assignment problem
- A note on solving large p-median problems
- A partial dual algorithm for the capacitated warehouse location problem
- A tree search algorithm for the p-median problem
- ADD-heuristics' starting procedures for capacitated plant location models
- An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems
- An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
- An algorithm for set covering problem
- An algorithm for solving large capacitated warehouse location problems
- An all Zero-One Algorithm for a Certain Class of Transportation Problems
- Efficient algorithms for the capacitated concentrator location problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- Facility location models for distribution planning
- Fast primal and dual heuristics for the \(p\)-median location problem
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Heuristics for the capacitated plant location model
- Kapazitätsplanung in Netzwerken. Ein Überblick über neuere Modelle und Verfahren. (Resource-constrained project planning in networks. A survey on new models and methods)
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- Lagrangian Relaxation and the Single-Source Capacitated Facility-Location Problem
- Linear Relaxations of the Capacitated Warehouse Location Problem
- Location problems
- Modeling Facility Location Problems as Generalized Assignment Problems
- Note—Single and Double Vertex Substitution in Heuristic Procedures for the p-Median Problem
- On the exact solution of large-scale simple plant location problems
- On the use of tree indexing methods in transportation algorithms
- Principal direction search: A new method of search for unconstrained LP formulations
- Probabilistic Analysis of a Relaxation for the k-Median Problem
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
- Technical Note—An Algorithm for the p-Median Problem
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The capacitated plant location problem
- The simple plant location problem: Survey and synthesis
- p-Medians and Multi-Medians
Cited in
(only showing first 100 items - show all)- A continuous location-allocation problem with zone-dependent fixed cost
- An effective heuristic for large-scale capacitated facility location problems
- A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
- Near-optimal large-scale k-medoids clustering
- An exact cooperative method for the uncapacitated facility location problem
- Stochastic facility location with general long-run costs and convex short-run costs
- Planning and coordination of production and distribution facilities for multiple commodities
- Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation
- A Lagrangean heuristic for the maximal covering location problem
- Facility location models for distribution system design
- Solving a dynamic facility location problem with partial closing and reopening
- Resource planning and a depot location model for electric power restoration.
- A hybrid multistart heuristic for the uncapacitated facility location problem
- A computational study of a nonlinear minsum facility location problem
- A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations
- An aggregation heuristic for large scale p-median problem
- Bounds for the single source modular capacitated plant location problem
- A simple filter-and-fan approach to the facility location problem
- Stronger \(K\)-tree relaxations for the vehicle routing problem
- On statistical bounds of heuristic solutions to location problems
- The \(p\)-median problem: a survey of metaheuristic approaches
- Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
- A Lagrangian heuristic algorithm for a public healthcare facility location problem
- Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
- Lagrangean heuristics applied to a variety of large capacitated plant location problems
- Computational study of large-scale \(p\)-median problems
- BEAMR: an exact and approximate model for the \(p\)-median problem
- Branch and peg algorithms for the simple plant location problem.
- Dynamic supply chain design with inventory
- Fast bounding procedures for large instances of the simple plant location problem
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
- Mean value cross decomposition for nonlinear convex problems
- An aggressive reduction scheme for the simple plant location problem
- A repeated matching heuristic for the single-source capacitated facility location problem
- A study on the budget constrained facility location model considering inventory management cost
- Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
- A Lagrangian search method for the \(P\)-median problem
- Upper and lower bounds for the single source capacitated location problem.
- A tree search algorithm for the crew scheduling problem
- Non delayed relax-and-cut algorithms
- Confidence in heuristic solutions?
- Lagrangean relaxation-based techniques for solving facility location problems
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- Maximization of submodular functions: theory and enumeration algorithms
- Solving the simple plant location problem by genetic algorithm
- Efficient primal-dual heuristic for a dynamic location problem
- Developing effective meta-heuristics for a probabilistic location model via experimental design
- Capacitated facility location problem with general setup cost
- Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
- A perturbation-based heuristic for the capacitated multisource Weber problem
- Massively parallel analog tabu search using neural networks applied to simple plant location problems
- A Lagrangean heuristic for the facility location problem with staircase costs
- A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem
- A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem
- A Langrangean heuristic for the \(p_ k\)-median dynamic location problem
- Optimal political districting
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- An exact algorithm for the capacitated facility location problems with single sourcing
- An exact method for the two-echelon, single-source, capacitated facility location problem
- Solving the uncapacitated facility location problem using tabu search
- Optimization of production allocation and transportation of customer orders for a leading forest products company
- A multiperiod two-echelon multicommodity capacitated plant location problem
- A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand
- Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem
- A cutting plane algorithm for the capacitated facility location problem
- Branch and peg algorithms for the simple plant location problem
- The capacitated plant location problem with multiple facilities in the same site
- Defining tabu list size and aspiration criterion within tabu search methods
- Scatter search for the single source capacitated facility location problem
- Fuzzy programming and profit and cost allocation for a production and transportation problem
- Observations on some heuristic methods for the capacitated facility location problem
- Locating repair shops in a stochastic environment
- Metaheuristic applications on discrete facility location problems: a survey
- Logistics distribution centers location problem and algorithm under fuzzy environment
- On the use of genetic algorithms to solve location problems
- The min-p robust optimization approach for facility location problem under uncertainty
- Decomposition and dynamic cut generation in integer linear programming
- Imposing contiguity constraints in political districting models
- A branch-and-price algorithm for the capacitated facility location problem
- A multiobjective evolutionary approach for linearly constrained project selection under uncertainty
- Resource-constrained management of heterogeneous assets with stochastic deterioration
- Mathematical programming based heuristics for the 0--1 MIP: a survey
- The balanced \(p\)-median problem with unitary demand
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
- A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem
- A feasibility-ensured Lagrangian heuristic for general decomposable problems
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
- Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
- Exact solution methods for uncapacitated location problems with convex transportation costs
- A dual RAMP algorithm for single source capacitated facility location problems
- On a class of subadditive duals for the uncapacitated facility location problem
- A meta-heuristic extension of the Lagrangian heuristic framework
- Matheuristics: survey and synthesis
- scientific article; zbMATH DE number 2230234 (Why is no real title available?)
- Designing reliable tree networks with two cable technologies
- RAMP algorithms for the capacitated facility location problem
- Lagrangian heuristics for large-scale dynamic facility location with generalized modular capacities
- Add/drop procedures for the capacitated plant location problem
- Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses
- A capacitated facility location problem with constrained backlogging probabilities
This page was built for publication: Lagrangean heuristics for location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804069)
