2020•Americanae (AECID Library)Open access

New approaches for the two-level facility location problem: models and algorithms

Paganini Barcellos de Oliveira

Open full text 0 citations

Abstract

Submitted by Paganini Oliveira (paganinib@ufmg.br) on 2020-03-17T20:30:09Z No. of bitstreams: 2 license_rdf: 811 bytes, checksum: cfd6801dba008cb6adbd9838b81582ab (MD5) New_Approaches_to_the_Two_Level_Facility_Location_Problem__Models_and_Algorithms.pdf: 4234624 bytes, checksum: f93578edfcf8e206ef6553e8066d7e97 (MD5)

About this research paper

What this paper is about

Submitted by Paganini Oliveira (paganinib@ufmg.br) on 2020-03-17T20:30:09Z No. of bitstreams: 2 license_rdf: 811 bytes, checksum: cfd6801dba008cb6adbd9838b81582ab (MD5) New_Approaches_to_the_Two_Level_Facility_Location_Problem__Models_and_Algorithms.pdf: 4234624 bytes, checksum: f93578edfcf8e206ef6553e8066d7e97 (MD5)

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Submitted by Paganini Oliveira (paganinib@ufmg.br) on 2020-03-17T20:30:09Z No. of bitstreams: 2 license_rdf: 811 bytes, checksum: cfd6801dba008cb6adbd9838b81582ab (MD5) New_Approaches_to_the_Two_Level_Facility_Location_Problem__Models_and_Algorithms.pdf: 4234624 bytes, checksum: f93578edfcf8e206ef6553e8066d7e97 (MD5)

Key concepts: Transshipment (information security), Facility location problem, Heuristic, Computer science, Mathematical optimization, Time horizon, Set (abstract data type), Container (type theory)

Related papers

Back to paper searchBrowse research topicsOriginal source
New approaches for the two-level facility location problem: models and algorithms — Research Paper | ScholarLens