Branch and peg algorithms for the simple plant location problem

No abstract is available for this paper.

• Publication year

  2003

• Venue

  Computers & Operations Research

• Publication date

  2003-06-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/S0305-0548(02)00049-7
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Solving the Simple Plant Location Problem using a Data Correcting Approach

  2003cited by this paper
• Special Issue: OR/MS and E-Business: Optimization as an Internet Resource

  2001cited by this paper
• The Data-Correcting Algorithm for the Minimization of Supermodular Functions

  1999cited by this paper
• Multidimensional assortment problem with an application

  1999cited by this paper
• The Plant Location Problem: New Models and Research Prospects

  1996cited by this paper
• Requirements of Standards: Optimization Models and Algorithms

  1995cited by this paper
• Specially Structured Uncapacitated Facility Location Problems

  1995cited by this paper
• Lagrangean heuristics for location problems

  1993cited by this paper
• Discrete location theory

  1991cited by this paper
• On the exact solution of large-scale simple plant location problems

  1989cited by this paper
• The Discrete Two-Dimensional Assortment Problem

  1988cited by this paper
• Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem

  1987cited by this paper
• Valid inequalities for mixed 0-1 programs

  1986cited by this paper
• Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming

  1985cited by this paper
• On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems

  1983cited by this paper
• On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets

  1983cited by this paper
• The simple plant location problem: Survey and synthesis

  1983cited by this paper
• A Primal Approach To the Simple Plant Location Problem

  1982cited by this paper
• Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms"

  1979cited by this paper
• On the Extent to Which Certain Fixed-Charge Depot Location Problems can be Solved by LP

  1978cited by this paper
• A Dual-Based Procedure for Uncapacitated Facility Location

  1978cited by this paper
• On the Uncapacitated Location Problem

  1977cited by this paper
• Algorithms for Exploiting the Structure of the Simple Plant Location Problem

  1977cited by this paper
• The Assortment Problem with Nonlinear Cost Functions

  1976cited by this paper
• Implicit representation of variable upper bounds in linear programming

  1975cited by this paper
• Sur l'implantation d'équipement dans un réseau : le problème de m-centre

  1975cited by this paper
• Graph Theory. An Algorithmic Approach

  1975cited by this paper
• Graph theory: An algorithmic approach (Computer science and applied mathematics)

  1975cited by this paper
• An Algorithm for the M-Median Plant Location Problem

  1974cited by this paper
• Validation of subgradient optimization

  1974cited by this paper
• On the Set-Covering Problem

  1972cited by this paper

• Learning-Based Problem Reduction for Large-Scale Uncapacitated Facility Location Problems

  2024cites this paper
• A comprehensive survey of recent advances in facility location problems: Models, solution methods, and applications

  2024cites this paper
• Solving unconstrained binary polynomial programs with limited reach: Application to low autocorrelation binary sequences

  2024cites this paper
• Generate Competitive Solutions for Uncapacitated Facility Location Problem by Learning from Small Instances

  2023cites this paper
• A human learning optimization algorithm with competitive and cooperative learning

  2022cites this paper
• Binary crow search algorithm for the uncapacitated facility location problem

  2021cites this paper
• On Solving Large-Size Generalized Cell Formation Problems via a Hard Computing Approach Using the PMP

  2020cites this paper
• Optimal allocation of defibrillator drones in mountainous regions

  2019cites this paper
• Berge-acyclic multilinear 0-1 optimization problems

  2019cites this paper
• A simple multi-wave algorithm for the uncapacitated facility location problem

  2018cites this paper
• Research on Location Problem of Multi-distribution Center based on Chaos Adaptive Mutation Particle Swarm Optimization Algorithm

  2016cites this paper
• A GPU-based Branch-and-Bound algorithm using Integer-Vector-Matrix data structure

  2016cites this paper
• Work stealing with private integer–vector–matrix data structure for multi‐core branch‐and‐bound algorithms

  2016cites this paper
• Research on the Location Model Based on Clustering Local Search Algorithm under Electronic Commerce

  2015cites this paper
• On a class of subadditive duals for the uncapacitated facility location problem

  2015cites this paper
• A new method for the selection of distribution centre locations

  2015cites this paper
• A Survey of Discrete Facility Location Problems

  2015cites this paper
• Fixed-Charge Facility Location Problems

  2015cites this paper
• An application of a Lagrangian-type relaxation for the uncapacitated facility location problem

  2014cites this paper
• Work Stealing Strategies For Multi-Core Parallel Branch-and-Bound Algorithm Using Factorial Number System

  2014cites this paper
• An application of a Lagrangian-type relaxation for the uncapacitated facility location problem

  2014cites this paper
• A Multi-core Parallel Branch-and-Bound Algorithm Using Factorial Number System

  2014cites this paper
• An exact cooperative method for the uncapacitated facility location problem

  2014cites this paper
• Computational Science and Its Applications – ICCSA 2013

  2013cites this paper
• Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem

  2013influential citation
• A decision framework for assessment of risk associated with global supply chain

  2013cites this paper
• Application of Advanced Hybrid Genetic Algorithms for Optimal Locations of High School

  2013cites this paper
• Data correcting approach to routing and location in networks

  2013cites this paper
• Branch‐and‐Bound Methods

  2013cites this paper
• CASE STUDY: BEREKUM MUNICIPALITY

  2013cites this paper
• Fast bounding procedures for large instances of the Simple Plant Location Problem

  2012cites this paper
• Data Correcting Approach for the Simple Plant Location Problem

  2012cites this paper
• Maximization of Submodular Functions: Theory and Algorithms

  2012cites this paper
• Data Correcting Approach for the Maximization of Submodular Functions

  2012cites this paper
• Boolean Functions

  2011cites this paper
• Exact Solution of Two Location Problems via Branch-and-Bound

  2011cites this paper
• Achieving Memetic Adaptability by Means of Agent-Based Machine Learning

  2011cites this paper
• Selection of logistics center location using Axiomatic Fuzzy Set and TOPSIS methodology in logistics management

  2011cites this paper
• Solving Large p-Median Problems with a Radius Formulation

  2011cites this paper
• (Case study: Amansie West District)

  2011cites this paper
• Ant colony optimisation : a proposed solution framework for the capacitated facility location problem

  2011cites this paper
• New Genetic Algorithms Based Approaches to Continuous p-Median Problem

  2011cites this paper
• Data aggregation for p-median problems

  2011cites this paper
• A novel clustering-based approach for the location of multi-logistics centers

  2010cites this paper
• A Research of Robust Location Model of Enterprise Logistics Centers

  2009cites this paper
• Computer Simulation-based Optimization: Hybrid Branch & Bound and Orthogonal Array based Enumeration Algorithm

  2009cites this paper
• Integrating customer responsiveness and distribution cost in designing a two-echelon supply chain network with considering capacity level and piecewise linear cost

  2008cites this paper
• An acceleration of Erlenkotter-Körkel’s algorithms for the uncapacitated facility location problem

  2008influential citation
• The Uncapacitated Facility Location Problem: Some Applications in Scheduling and Routing

  2008cites this paper
• DYNAMIC MODELING OF NETWORKS AND LOGISTIC COMPLEX SYSTEMS

  2008cites this paper
• Logistics distribution centers location problem and algorithm under fuzzy environment

  2007cites this paper
• A strengthened formulation for the simple plant location problem with order

  2007cites this paper
• Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing

  2006cites this paper
• Integrating Competitive and Uncompetitive Facilities Location Decisions in a Strategic Multi-echelon Distribution Network Design Mode

  2006cites this paper
• Design and Operation of Inland Ports as Nodes of the Trans-Texas Corridor

  2005cites this paper
• Facility location models for distribution system design

  2005cites this paper
• A two-level distribution network design based on inventory cost optimization

  2005cites this paper
• Branch and win: OR tree search algorithms for solving combinatorial optimisation problems

  2004cites this paper
• Evolutionary Simulated Annealing Algorithms for Uncapacitated Facility Location Problems

  2004cites this paper
• Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem

  2003cites this paper