SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

A Lagrangean Heuristic for a Modular Capacitated Location Problem · Study

ArticleShelves

ArticleA Lagrangean Heuristic for a Modular Capacitated Location Problem

Isabel Correia2003

Article2003

A Lagrangean Heuristic for a Modular Capacitated Location Problem

Isabel Correia · M. Eugénia Captivo

68 citations·0/0 files stored·Annals of Operations Research

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Facility Location and Emergency Management Vehicle Routing Optimization Methods Optimization and Mathematical Programming

Abstract

No abstract was published for this record.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 68 citations exist upstream.

References

1997Network and Discrete Location: Models, Algorithms and Applications.1995Network and Discrete Location 1993Lagrangean heuristics for location problems 1991A comparison of heuristics and relaxations for the capacitated plant location problem 1995The capacitated plant location problem 1988An algorithm for solving large capacitated warehouse location problems 1994Solving the staircase cost facility location problem with decomposition and piecewise linearization 1997A Lagrangean heuristic for the facility location problem with staircase costs

Cited by

2017A modular capacitated multi-objective model for locating maritime search and rescue vessels 2020Heuristics for the dynamic facility location problem with modular capacities 2007Stochastic facility location with general long-run costs and convex short-run costs 2022Modular and mobile facility location problems: A systematic review 2007Branch and bound algorithm for a facility location problem with concave site dependent costs

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

2000A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problemarticle · 6 shared references 2007A single-product network design model with lead time and safety stock considerationsarticle · 4 shared references 2014Metaheuristic applications on discrete facility location problems: a surveyarticle · 4 shared references 2011A tabu search heuristic procedure for the capacitated facility location problemarticle · 4 shared references 2007Branch and bound algorithm for a facility location problem with concave site dependent costsarticle · 4 shared references 1997Location and layout planningarticle · 4 shared references

Details

Year2003

Typearticle

Published2003-09-01

VenueAnnals of Operations Research

ISSN-L0254-5330

Languageen

Citations68

Files0 public / 0

ShelfFacility Location and Emergency Management

Identifiers

doi10.1023/a:1026146507143

openalex_workW27142857

Links

Imported from OpenAlex (CC0) — nothing here is generated.

2017

Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities

2004On the capacitated concentrator location problem: a reformulation by discretization

2005Location of slaughterhouses under economies of scale