A Branch-And-Price Approach to P-Median Location Problems

Computers and Operations Research - United Kingdom
doi 10.1016/j.cor.2003.11.024
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

A Branch-Price-And-Cut Procedure for the Discrete Ordered Median Problem

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
2020English

Inverse Median Location Problems With Variable Coordinates

Central European Journal of Operations Research
Management ScienceOperations Research
2009English

Erratum To: A Branch-And-Price Algorithm for Two Multi-Compartment Vehicle Routing Problems

EURO Journal on Transportation and Logistics
Management ScienceSimulationTransportationOperations ResearchModeling
2017English

GRASP Heuristic for P-Median Problem Applied to the Location of Concentrators

Revista Vértices
2011English

Circulation of Railway Rolling Stock: A Branch-And-Price Approach

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2008English

A New Formulation Approach for Location-Routing Problems

Networks and Spatial Economics
Computer NetworksSoftwareArtificial IntelligenceCommunications
2012English

A TEST OF THE SIZE-DENSITY HYPOTHESIS IN P-Median PROBLEMS

Journal of Architecture and Planning (Transactions of AIJ)
2000English

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

A Branch-And-Bound Method for the Multichromosomal Reversal Median Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy