scientific article
From MaRDI portal
Publication:3351135
zbMath0727.90043MaRDI QIDQ3351135
Laurence A. Wolsey, Cornuéjols, Gérard, Nemhauser, George I.
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveyclusteringHeuristicsNP-hardprobabilistic resultsp-median problemDecompositionuncapacitated facility locationLagrangian DualitySubmodularityPolyhedral Combinatoricsexact solution procedurespolyomial algorithms
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Mixed integer programming (90C11) Linear programming (90C05) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Optimal and heuristic algorithms for multiproduct uncapacitated facility location, A bi-objective approach to discrete cost-bottleneck location problems, Combinatorial approximation algorithms for the robust facility location problem with penalties, On the computational complexity of uncapacitated multi-plant lot-sizing problems, Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system, A Lagrangian heuristic for the capacitated plant location problem with single source constraints, Clustering to minimize the sum of cluster diameters, On the coordination of product and by-product flows in two-level distribution networks: Model formulations and solution procedures, Heuristic algorithms for solving an integrated dynamic center facility location -- network design model, Multi-level facility location as the maximization of a submodular set function, The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties, Optimizing location of manufacturing industries in the context of economic globalization: a bi-level model based approach, Tactical network planning for food aid distribution in Kenya, Efficient primal-dual heuristic for a dynamic location problem, A hybrid multistart heuristic for the uncapacitated facility location problem, An exact algorithm for the modular hub location problem with single assignments, Two-stage stochastic programming supply chain model for biodiesel production via wastewater treatment, Approximation algorithms for facility location problems with a special class of subadditive cost functions, A parallel branch-and-bound algorithm for multicommodity location with balancing requirements, Strategic design of distribution systems with economies of scale in transportation, Designing cost-effective content distribution networks, Stability and fairness in models with a multiple membership, A model for the capacitated \(p\)-facility location problem in global environments, Competitive facility location model with concave demand, A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem, A Lagrangian search method for the \(P\)-median problem, General network design: a unified view of combined location and network design problems, The single period coverage facility location problem: Lagrangean heuristic and column generation approaches, Revisiting Lagrangian relaxation for network design, Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms, Fast approximate energy minimization with label costs, A supply chain design problem with facility location and bi-objective transportation choices, Neighborhood search heuristics for the uncapacitated facility location problem, On a class of subadditive duals for the uncapacitated facility location problem, The gradual covering decay location problem on a network., Budget constrained location problem with opening and closing of facilities., Multiperiod location-routing with decoupled time scales, A projection method for the uncapacitated facility location problem, Discrete facility location with nonlinear diseconomies in fixed costs, Models for multimode multicommodity location problems with interdepot balancing requirements, Branch and peg algorithms for the simple plant location problem., Graph clustering, Voluntary formation of communities for the provision of public projects., Approximation algorithms for the dynamic \(k\)-level facility location problems, Combining VNS with constraint programming for solving anytime optimization problems, Branch-and-cut-and-price for capacitated connected facility location, An exact cooperative method for the uncapacitated facility location problem, Micro-review synthesis for multi-entity summarization, New valid inequalities and facets for the simple plant location problem, Relaxations for probabilistically constrained programs with discrete random variables, Multi-level facility location problems, Risk management in uncapacitated facility location models with random demands, A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method, Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths, Fast bounding procedures for large instances of the simple plant location problem, An application of a Lagrangian-type relaxation for the uncapacitated facility location problem, A new approximation algorithm for the multilevel facility location problem, Branch and peg algorithms for the simple plant location problem, Equivalent instances of the simple plant location problem, A simple and deterministic competitive algorithm for online facility location, A simple tabu search for warehouse location, Models and methods for standardization problems, Adapting polyhedral properties from facility to hub location problems, Generalized coverage: new developments in covering location models, Improved approximation algorithms for capacitated facility location problems, An efficient model formulation for level of repair analysis, A tighter formulation of the \(p\)-median problem, An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem, Location analysis: a synthesis and survey, Near-optimal solutions to large-scale facility location problems, Approximation algorithms for the transportation problem with market choice and related models, Large-scale influence maximization via maximal covering location, An improved Lagrangian relaxation and dual ascent approach to facility location problems, On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines, Location of differentiated waste collection centers with user cooperation: a bilevel optimization approach, Valid inequalities and facets of the capacitated plant location problem, Exact solution methods for uncapacitated location problems with convex transportation costs, Integer-friendly formulations for the \(r\)-separation problem, \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts, A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem, Properties of some ILP formulations of a class of partitioning problems, A separation algorithm for the simple plant location problem, A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem, A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem, Plant location with minimum inventory, Some personal views on the current state and the future of locational analysis, An 0. 828-approximation algorithm for the uncapacitated facility location problem, An optimization approach to plan for reusable software components, On the facets of the simple plant location packing polytope, Separating lifted odd-hole inequalities to solve the index selection problem, The multiple traveling salesman problem in presence of drone- and robot-supported packet stations, Location problems, A unifying location model on tree graphs based on submodularity property, Integer programming formulations of discrete hub location problems, An approximation algorithm for the maximization version of the two level uncapacitated facility location problem, A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem, A note on the maximization version of the multi-level facility location problem, Multiobjective solution of the uncapacitated plant location problem, A constant-factor approximation algorithm for the \(k\)-median problem, An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure, A study on the budget constrained facility location model considering inventory management cost, A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints, Approximation algorithms for hard capacitated \(k\)-facility location problems, Solving the \(p\)-median problem on regular and lattice networks, Approximation Algorithms for the Robust Facility Location Problem with Penalties, Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection, Agile optimization for a real‐time facility location problem in Internet of Vehicles networks, A note on the implications of approximate submodularity in discrete optimization, A parameterized approximation algorithm for the multiple allocation \(k\)-hub center, Unnamed Item, Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location, A location-routing problem for the conversion to the ``click-and-mortar retailing: the static case, Modeling health care facility location for moving population groups, Ejection chain and filter-and-fan methods in combinatorial optimization, A CONVEX SUBMODEL WITH APPLICATION TO SYSTEM DESIGN, Star \(p\)-hub median problem with modular arc capacities, On solving complex multi-period location models using simulated annealing., Solving the simple plant location problem by genetic algorithm, The multi-level uncapacitated facility location problem is not submodular, Solving the uncapacitated facility location problem using tabu search, A simple filter-and-fan approach to the facility location problem, Level of repair analysis and minimum cost homomorphisms of graphs, Simple dynamic location problem with uncertainty: a primal-dual heuristic approach, Lot-sizing with production and delivery time windows, Siting noxious facilities under uncertainty, Hedging uncertainty: approximation algorithms for stochastic optimization problems, An approximation algorithm for a facility location problem with stochastic demands and inventories, A family of facets for the uncapacitated \(p\)-median polytope, Cross-facility management of production and transportation planning problem, The generalized maximal covering location problem, The multi-level uncapacitated facility location problem is not submodular, An ex-post bound on the greedy heuristic for the uncapacitated facility location problem, A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions, An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
