On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon

DOI10.1007/s11750-017-0461-4zbMath1386.90070OpenAlexW2744195692MaRDI QIDQ1688448

Celeste Pizarro Romero, Laureano Fernando Escudero Bueno

Publication date: 5 January 2018

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-017-0461-4

zbMATH Keywords

location assignmentinteraction costs0-1 QP modelequivalent 0-1 MILP formulationfix-and-relax matheuristic

Mathematics Subject Classification ID

Quadratic programming (90C20) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (1)

Multi-period single-allocation hub location-routing: models and heuristic solutions

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty
• Solving a dynamic facility location problem with partial closing and reopening
• Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
• A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
• RLT: A unified approach for discrete and continuous nonconvex optimization
• A computational comparison of several formulations for the multi-period incremental service facility location problem
• On a fix-and-relax framework for a class of project scheduling problems
• The multi-period incremental service facility location problem
• A quadratic integer program for the location of interacting hub facilities
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
• On practical resource allocation for production planning and scheduling with period overlapping setups
• Multi-period capacitated facility location under delayed demand satisfaction
• Improved semidefinite bounding procedure for solving max-cut problems to optimality
• On random quadratic bottleneck assignment problems
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities
• Location Science

This page was built for publication: On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon