A Dual-Based Procedure for Uncapacitated Facility Location
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Heuristics for the capacitated plant location model
- A comparison of two dual-based procedures for solving the p-median problem
- A tree search algorithm for the multi-commodity location problem
- Principal direction search: A new method of search for unconstrained LP formulations
- A simple plant-location model for quantity-setting firms subject to price uncertainty
- Zero-one integer programs with few contraints - lower bounding theory
- Facility location models for distribution planning
- 'Multidimensional' extensions and a nested dual approach for the m-median problem
- Optimal and heuristic algorithms for multiproduct uncapacitated facility location
- Efficient algorithms for the capacitated concentrator location problem
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
- On the exact solution of large-scale simple plant location problems
- An exact algorithm for the capacitated facility location problems with single sourcing
- Solving a distribution problem with side constraints
- Simple plant location under uniform delivered pricing
- Developments in network location with mobile and congested facilities
- A cost operator approach to multistage location-allocation
- A large scale location-allocation problem in the natural rubber industry
- A tree search algorithm for the p-median problem
- Dynamic versions of set covering type public facility location problems
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- Locational analysis
- Fast primal and dual heuristics for the \(p\)-median location problem
- A solution procedure for the file allocation problem with file availability and response time
- A fuzzy set-theoretic method for public facility location
- Configuration of fully replicated distributed database system over wide area networks
- Locating concentrators in centralized computer networks
- An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies
- A survey of algorithms for the generalized assignment problem
- Optimal design of a distributed network with a two-level hierarchical structure
- File allocation involving worst case response times and link capacities: Model and solution procedure
- Facility siting and integer-friendly programming
- Massively parallel analog tabu search using neural networks applied to simple plant location problems
- A bi-objective uncapacitated facility location problem
- Optimal location and capacity of emergency cleanup equipment for oil spill response
- A Lagrangean heuristic for the facility location problem with staircase costs
- Planning models for freight transportation
- A branch and bound algorithm for the traveling purchaser problem
- Solving the plant location problem on a line by linear programming
- Plant location with minimum inventory
- Some personal views on the current state and the future of locational analysis
- Separating lifted odd-hole inequalities to solve the index selection problem
- Algorithms for a multi-level network optimization problem
- Planning and scheduling packaging lines in food industry
- Integer programming formulations of discrete hub location problems
- An extension of the \(p\)-median group technology algorithm
- Reason based solutions and the complexity of distribution network design problems
- Uncapacitated facility location: General solution procedure and computational experience
- Capacity expansion with alternative technology choices
- Application of the facility location problem to the problem of locating concentrators on an FAA microwave system
- On the coordination of product and by-product flows in two-level distribution networks: Model formulations and solution procedures
- Cluster analysis and mathematical programming
- A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
- Location and layout planning. A survey
- A model for the capacitated p-facility location problem in global environments
- Variable neighborhood search
- Parametric uncapacitated facility location
- The capacitated plant location problem
- Neighborhood search heuristics for the uncapacitated facility location problem
- Upper and lower bounds for the single source capacitated location problem.
- An interactive procedure dedicated to a bicriteria plant location model.
- Budget constrained location problem with opening and closing of facilities.
- A multiperiod two-echelon multicommodity capacitated plant location problem
- Clustering of objects and attributes for manufacturing and marketing applications
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- A repeated matching heuristic for the single-source capacitated facility location problem
- Multi-level facility location problems
- Fast bounding procedures for large instances of the simple plant location problem
- Location analysis: a synthesis and survey
- Near-optimal solutions to large-scale facility location problems
- An improved Lagrangian relaxation and dual ascent approach to facility location problems
- A branch-and-bound method for multicommodity location with balancing requirements
- Lagrangean heuristics for location problems
- The plant location problem with demand-dependent setup costs and centralized allocation
- Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type
- Exact solution methods for uncapacitated location problems with convex transportation costs
- Constraint satisfaction problems: Algorithms and applications
- A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem
- An application-oriented guide for designing Lagrangean dual ascent algorithms
- The simple plant location problem: Survey and synthesis
- Solving covering problems and the uncapacitated plant location problem on trees
- A combinatorial approach to level of repair analysis
- An optimization approach to plan for reusable software components
- Facility location with increasing production costs
- Multiobjective solution of the uncapacitated plant location problem
- Lagrangean relaxation. (With comments and rejoinder).
- A monotonic, dual-based bounding procedure for integer programs
- A robustness approach to international sourcing
- A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements
- A two-phased approach to the supply network reconfiguration problem
- Algorithmic expedients for the S-labeling problem
- RAMP algorithms for the capacitated facility location problem
- A dual RAMP algorithm for single source capacitated facility location problems
- A new local search for continuous location problems
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
- An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
- A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- Topological design of a two-level network with ring-star configuration
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)
