SZodixStudyAcademic Library

Shelves Open access

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

A branch-and-bound algorithm for depot location and container fleet management · Study

ArticleShelves

ArticleA branch-and-bound algorithm for depot location and container fleet management

Bernard Gendron1995

Article1995

A branch-and-bound algorithm for depot location and container fleet management

Bernard Gendron · Teodor Gabriel Crainic

53 citations·0/0 files stored·Location Science

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 Maritime Ports and Logistics 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 — 53 citations exist upstream.

References

1991Discrete location theory 1978A Dual-Based Procedure for Uncapacitated Facility Location 1983The simple plant location problem: Survey and synthesis 1990The uncapacitated facility location problem 1982A Dual-Based Procedure for Dynamic Facility Location 1993A tabu search procedure for multicommodity location/allocation with balancing requirements 1989Models for multimode multicommodity location problems with interdepot balancing requirements 1993Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements

Cited by

1999Applying Lagrangian relaxation to the resolution of two‐stage location problems 2020Dynamic location of modular manufacturing facilities with relocation of individual modules 2003A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements 1997A parallel branch-and-bound algorithm for multicommodity location with balancing requirements 2008New facets for the two-stage uncapacitated facility location polytope

Related works

Explore the map →

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

1997A parallel branch-and-bound algorithm for multicommodity location with balancing requirementsarticle · 8 shared references 1988Perceptual maps and the optimal location of new products: An integrative essayarticle · 5 shared references 2005Efficient primal-dual heuristic for a dynamic location problemarticle · 5 shared references 1993Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirementsarticle · 5 shared references 2000Branch-and-bound parallelization strategies applied to a depot location and container fleet management problemarticle · 5 shared references 2007Branch and bound algorithm for a facility location problem with concave site dependent costsarticle · 5 shared references

Details

Year1995

Typearticle

Published1995-05-01

VenueLocation Science

ISSN-L0966-8349

Languageen

Citations53

Files0 public / 0

ShelfFacility Location and Emergency Management

Identifiers

doi10.1016/0966-8349(95)00005-3

openalex_workW2003594070

Links

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