Closest assignment constraints and location models: Properties and structure
From MaRDI portal
Publication:4228769
DOI10.1016/S0966-8349(97)00001-6zbMATH Open0930.90054OpenAlexW1972198184MaRDI QIDQ4228769FDOQ4228769
Authors: Ross A. Gerrard, Richard L. Church
Publication date: 1 March 1999
Published in: Location Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0966-8349(97)00001-6
Recommendations
- Closest assignment constraints in discrete location problems
- scientific article; zbMATH DE number 4047401
- A flexible model and efficient solution strategies for discrete location problems
- A flexible model and efficient solution strategies for discrete location problems
- Models, algorithms and applications for location problems
- Quality locations for the constrained minimax location model
- scientific article; zbMATH DE number 1967834
- Facility Location Problems: A Parameterized View
- Facility location problems: a parameterized view
- The capacity constrained facility location problem
Cited In (16)
- A robust disaster preparedness model for effective and fair disaster response
- Location of courts of justice: the making of the new judiciary map of Portugal
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
- Hub interdiction problem variants: models and metaheuristic solution algorithms
- Location-allocation approaches for hospital network planning under uncertainty
- The maximin HAZMAT routing problem
- Organizing hospitals into networks: a hierarchical and multiservice model to define location, supply and referrals in planned hospital systems
- Location with preferences
- Closest assignment constraints in discrete location problems
- A bilevel mixed-integer program for critical infrastructure protection planning
- A Lagrangean decomposition for the maximum independent set problem applied to map labeling
- The budget constrained \(r\)-interdiction median problem with capacity expansion
- A hierarchical location model for public facility planning
- A strengthened formulation for the simple plant location problem with order
- Customer allocation in maximum capture problems
- Lagrangean relaxation with clusters for point-feature cartographic label placement problems
This page was built for publication: Closest assignment constraints and location models: Properties and structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228769)