An aggressive reduction scheme for the simple plant location problem

DOI10.1016/J.EJOR.2013.10.020zbMATH Open1304.90123OpenAlexW2047629593WikidataQ57702142 ScholiaQ57702142MaRDI QIDQ2514768FDOQ2514768

Authors: Adam N. Letchford, Sebastian J. Miller 

Publication date: 3 February 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.10.020

Recommendations

• scientific article; zbMATH DE number 4010185
• On the exact solution of large-scale simple plant location problems
• scientific article; zbMATH DE number 1848396
• FEASIBLE REGION REDUCTION CUTS FOR THE SIMPLE PLANT LOCATION PROBLEM
• Logical reduction tests for the p-problem

zbMATH Keywords

combinatorial optimizationinteger programmingfacility location

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10) Discrete location and assignment (90B80)

Cites Work

• On the exact solution of large-scale simple plant location problems
• Neighborhood search heuristics for the uncapacitated facility location problem
• Lagrangean heuristics for location problems
• Solving the simple plant location problem by genetic algorithm
• Title not available (Why is that?)
• Uncapacitated and capacitated facility location problems
• Integer Programming: Methods, Uses, Computations
• A Dual-Based Procedure for Dynamic Facility Location
• The simple plant location problem: Survey and synthesis
• A Canonical Representation of Simple Plant Location Problems and Its Applications
• A Dual-Based Procedure for Uncapacitated Facility Location
• Solution of large quadratic knapsack problems through aggressive reduction
• Title not available (Why is that?)
• Title not available (Why is that?)
• Facility siting and integer-friendly programming
• Primal-dual variable neighborhood search for the simple plant-location problem
• Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
• Pivot and Complement–A Heuristic for 0-1 Programming
• Fast bounding procedures for large instances of the simple plant location problem
• Title not available (Why is that?)
• A method for solving to optimality uncapacitated location problems
• An implementation of the simplex method for linear programming problems with variable upper bounds
• Title not available (Why is that?)
• Probabilistic Analysis of a Relaxation for the k-Median Problem

Cited In (14)

• Title not available (Why is that?)
• On the exact solution of large-scale simple plant location problems
• New valid inequalities and facets for the simple plant location problem
• Plant location factors: a field research
• Efficient presolving methods for solving maximal covering and partial set covering location problems
• Multi-level facility location as the maximization of a submodular set function
• A separation algorithm for the simple plant location problem
• On a class of subadditive duals for the uncapacitated facility location problem
• An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
• An exact cooperative method for the uncapacitated facility location problem
• Approximation Algorithms for Generalized Plant Location
• Threshold robustness in discrete facility location problems: a bi-objective approach
• Equivalent instances of the simple plant location problem
• An improved Lagrangian relaxation and dual ascent approach to facility location problems

This page was built for publication: An aggressive reduction scheme for the simple plant location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2514768)