Discrete location for bundled demand points

DOI10.1007/s11750-009-0097-0zbMath1201.90121OpenAlexW1994431894MaRDI QIDQ611011

Alfredo Marín

Publication date: 13 December 2010

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-009-0097-0

zbMATH Keywords

Lagrangian relaxationvalid inequalitiesdiscrete location

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Related Items (1)

The discrete facility location problem with balanced allocation of customers

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
• Lower bounds for the two-stage uncapacitated facility location problem
• On the facets of the simple plant location packing polytope
• Lagrangean relaxation. (With comments and rejoinder).
• Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
• A strengthened formulation for the simple plant location problem with order
• Combinatorial Auctions: A Survey
• On the \(p\)-median polytope

This page was built for publication: Discrete location for bundled demand points