A Dual-Based Procedure for Uncapacitated Facility Location
From MaRDI portal
Publication:3856429
Cited in
(only showing first 100 items - show all)- Locating concentrators in centralized computer networks
- A dynamic location problem with maximum decreasing capacities
- Discrete equal-capacityp-median problem
- Fast bounding procedures for large instances of the simple plant location problem
- A simple filter-and-fan approach to the facility location problem
- A bi-objective uncapacitated facility location problem
- [NO TITLE AVAILABLE]
- BEAMR: an exact and approximate model for the \(p\)-median problem
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- An homage to Joseph-Louis Lagrange and Pierre Huard
- Dual ascent: variations of a theme
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Exact solution of two location problems via branch-and-bound
- Online facility location with facility movements
- Solving covering problems and the uncapacitated plant location problem on trees
- On solving the discrete location problems when the facilities are prone to failure
- Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
- Simple dynamic location problem with uncertainty: a primal-dual heuristic approach
- Incorporating cellular manufacturing into supply chain design
- Optimal design of a distributed network with a two-level hierarchical structure
- A monotonic, dual-based bounding procedure for integer programs
- The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation
- A simple and deterministic competitive algorithm for online facility location
- Capacitated facility location problem with general setup cost
- An interactive procedure dedicated to a bicriteria plant location model.
- A simple tabu search for warehouse location
- Facility location models for distribution system design
- A two-phased approach to the supply network reconfiguration problem
- An application-oriented guide for designing Lagrangean dual ascent algorithms
- Parallel algorithms for a multi-level network optimization problem
- Algorithmic expedients for the \(S\)-labeling problem
- A dual ascent approach for steiner tree problems on a directed graph
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
- A hybrid multistart heuristic for the uncapacitated facility location problem
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
- The \(p\)-median problem: a survey of metaheuristic approaches
- Affinity propagation: An exemplar‐based tool for clustering in psychological research
- Lower bounds for the two-stage uncapacitated facility location problem
- Defining tabu list size and aspiration criterion within tabu search methods
- HubLocator: An exact solution method for the multiple allocation hub location problem
- A survey of algorithms for the generalized assignment problem
- Heuristics for the capacitated plant location model
- Notation and classification for logistic network design models
- Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort
- Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
- An exact algorithm for the capacitated facility location problems with single sourcing
- On the exact solution of large-scale simple plant location problems
- Optimal location and capacity of emergency cleanup equipment for oil spill response
- Capacity planning with congestion effects
- A tree search algorithm for the p-median problem
- The stochastic location-assignment problem on a tree
- Optimal and heuristic algorithms for multiproduct uncapacitated facility location
- An exact solution procedure for a cluster hub location problem
- Massively parallel analog tabu search using neural networks applied to simple plant location problems
- Planning models for freight transportation
- Dual-based approach for a hub network design problem under non-restrictive policy
- Multi-level facility location problems
- Algorithms for a multi-level network optimization problem
- RAMP algorithms for the capacitated facility location problem
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- Integer programming formulations of discrete hub location problems
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
- Cluster analysis and mathematical programming
- Separating lifted odd-hole inequalities to solve the index selection problem
- Neighborhood search heuristics for the uncapacitated facility location problem
- Reason based solutions and the complexity of distribution network design problems
- On the coordination of product and by-product flows in two-level distribution networks: Model formulations and solution procedures
- Discrete facility location with nonlinear diseconomies in fixed costs
- A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements
- Cross-facility management of production and transportation planning problem
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- Capacity expansion with alternative technology choices
- A dual ascent procedure for the exact formulation of the simple plant location problem with spatial interaction
- Clustering of objects and attributes for manufacturing and marketing applications
- Multiobjective solution of the uncapacitated plant location problem
- A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
- Fast primal and dual heuristics for the \(p\)-median location problem
- Variable neighborhood search
- Sequential location-allocation problems on chains and trees with probabilistic link demands
- A note on duality gap in the simple plant location problem
- Lagrangean heuristics for location problems
- A Lagrangean dual ascent algorithm for simple plant location problems
- Forecast horizons and dynamic facility location planning
- A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand
- Matheuristics: survey and synthesis
- Multi-level facility location as the maximization of a submodular set function
- Uncapacitated and capacitated facility location problems
- A computational comparison of several formulations for the multi-period incremental service facility location problem
- Developments in network location with mobile and congested facilities
- Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items
- A facility location model for logistics systems including reverse flows: the case of remanufacturing activities
- Affinity propagation and uncapacitated facility location problems
- Formulations and relaxations for a multi-echelon capacitated location-distribution problem
- A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application
- Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution
- Agile optimization for a real‐time facility location problem in Internet of Vehicles networks
- New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach
- Uncapacitated facility location: General solution procedure and computational experience
- Efficient algorithms for the capacitated concentrator location problem
- Exact solution methods for uncapacitated location problems with convex transportation costs
This page was built for publication: A Dual-Based Procedure for Uncapacitated Facility Location
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3856429)
