Threshold robustness in discrete facility location problems: a bi-objective approach

DOI10.1007/s11590-015-0892-5zbMath1326.90043OpenAlexW2165426065MaRDI QIDQ499687

Emilio Carrizosa, Anton Vladimirovich Ushakov, Igor' Leonidovich Vasilyev

Publication date: 6 October 2015

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/handle//11441/107825

zbMATH Keywords

robustness\(p\)-median problem\(\delta\)-dominating set\(\varepsilon\)-constraint methodbi-objective combinatorial optimizationdiscrete facility locationUFLP

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (4)

Radius of Robust Feasibility for Mixed-Integer Problems ⋮ The multilevel facility location and pricing problems: the computational complexity and the stability analysis ⋮ Unnamed Item ⋮ Stability Analysis for Pricing

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
• Solving a bicriteria problem of optimal service centers location
• Locating a competitive facility in the plane with a robustness criterion
• On a robustness property in single-facility location in continuous space
• The \(p\)-median problem: a survey of metaheuristic approaches
• Computational study of large-scale \(p\)-median problems
• A bi-objective stochastic optimization model for reliable warehouse network redesign
• Complexity of local search for the \(p\)-median problem
• Multiple criteria facility location problems: a survey
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• On the exact solution of large-scale simple plant location problems
• Multiobjective programming and planning
• A computational investigation of linear parametrization of criteria in multicriteria discrete programming
• Semi-obnoxious location models: A global optimization approach
• Robust solutions of uncertain linear programs
• Multiple criteria optimization: State of the art annotated bibliographic surveys
• Robust facility location
• Robust discrete optimization and network flows
• Numerical analysis of tricriteria tree and assignment problems
• Combinatorial optimization problems with two and three criteria
• Robust and reliable forward-reverse logistics network design under demand uncertainty and facility disruptions
• The bi-objective stochastic covering tour problem
• An aggregation heuristic for large scale p-median problem
• The simple plant location problem: Survey and synthesis
• A D.C. biobjective location model
• The linear convolution of criteria in the bicriteria traveling salesman problem
• Recent advances in robust optimization: an overview
• The multicriteria \(p\)-facility median location problem on networks
• An aggressive reduction scheme for the simple plant location problem
• Robust Convex Optimization
• Solution methods for thep-median problem: An annotated bibliography
• The Price of Robustness
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems
• Robust Optimization of Large-Scale Systems
• Multicriteria Optimization
• Uncapacitated and Capacitated Facility Location Problems
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: Threshold robustness in discrete facility location problems: a bi-objective approach