Branch and Peg Algorithms for the Simple Plant Location Problem

Computers and Operations Research - United Kingdom
doi 10.1016/s0305-0548(02)00049-7
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Feasible Region Reduction Cuts for the Simple Plant Location Problem

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
1996English

Heuristic Algorithms for the Capacitated Location-Routing Problem and the Multi-Depot Vehicle Routing Problem

4OR
MathematicsManagement ScienceManagement Information SystemsComputational TheoryOperations ResearchTheoretical Computer Science
2013English

A Comparison of Parallel Branch and Bound Algorithms for Location-Transportation Problems in Humanitarian Relief

International Journal of GEOMATE
BuildingGeotechnical EngineeringSoil ScienceEngineering GeologyConstructionEnvironmental Engineering
2017English

Benders Decomposition Algorithms for Two Variants of the Single Allocation Hub Location Problem

Networks and Spatial Economics
Computer NetworksSoftwareArtificial IntelligenceCommunications
2018English

Two-Dimensional Optimization Problem of Plant Location

Vietnam Journal of Mechanics
2001English

A Lagrangian-Based Branch-And-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem With Single-Assignment Constraints

Transportation Science
CivilTransportationStructural Engineering
2016English

Simple Algorithms for Calculation of the Axial‐symmetric Heat Transport Problem in a Cylinder

Mathematical Modeling and Analysis
ModelingAnalysisSimulation
2001English

Theory and Algorithms for the Haplotype Assembly Problem

Communications in Information and Systems
2010English

The Regenerator Location Problem

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy