SZodixStudyAcademic Library

Shelves Open access

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

Lagrangean relaxation for the capacitated hub location problem with single assignment · Study

ArticleShelves

ArticleLagrangean relaxation for the capacitated hub location problem with single assignment

Ivan Contreras2009

Article2009

Lagrangean relaxation for the capacitated hub location problem with single assignment

Ivan Contreras · Juan A. Dı́az · Elena Fernández

106 citations·0/0 files stored·OR Spectrum

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 Complexity and Algorithms in Graphs Vehicle Routing Optimization Methods

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 — 106 citations exist upstream.

References

2001Facility location : applications and theory 1987A quadratic integer program for the location of interacting hub facilities 2007Network hub location problems: The state of the art 1994Integer programming formulations of discrete hub location problems 1996Efficient algorithms for the uncapacitated single allocation p-hub median problem 1996Tight linear programming relaxations of uncapacitated p-hub median problems 1999Solution algorithms for the capacitated single allocation hub location problem 2002Hub Location Problems

Cited by

2010Single-assignment hub location problems with multiple capacity levels 2020Optimizing vaccine distribution networks in low and middle-income countries 2010The Dynamic Uncapacitated Hub Location Problem 2010Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment 2015Hub Location Problems 2008Tight bounds from a path based formulation for the tree of hub location problem

Related works

Explore the map →

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

2015Hub Location Problemschapter · 17 shared references 2019Hub Location Problemschapter · 16 shared references 2012An improved Benders decomposition algorithm for the tree of hubs location problemarticle · 15 shared references 2014Robust optimization approach to capacitated single and multiple allocation hub location problemsarticle · 15 shared references 2008Multiple allocation hub-and-spoke network design under hub congestionarticle · 14 shared references 2011Allocation strategies in hub networksarticle · 13 shared references

Details

Year2009

Typearticle

Published2009-01-10

VenueOR Spectrum

ISSN-L0171-6468

Languageen

Citations106

Files0 public / 0

ShelfFacility Location and Emergency Management

Identifiers

doi10.1007/s00291-008-0159-y

openalex_workW2071259461

Links

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

2012Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels

2010The capacitated single-allocation hub location problem revisited: A note on a classical formulation