scientific article; zbMATH DE number 1279217

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6750(199903)46:2<147::AID-NAV2>3.0.CO;2-4" /><147::AID-NAV2>3.0.CO;2-4 10.1002/(SICI)1520-6750(199903)46:2<147::AID-NAV2>3.0.CO;2-4zbMath0918.90101MaRDI QIDQ4239707

George L. Vairaktarakis, Panagiotis Kouvelis

Publication date: 4 August 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

tree networkrelative robustness1-median formulationsrobust deviation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items (10)

A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty ⋮ Robust mean absolute deviation problems on networks with linear vertex weights ⋮ Ambulance Emergency Response Optimization in Developing Countries ⋮ Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights ⋮ Lexicographicα-robustness: an application to the 1-median problem ⋮ Robust location problems with pos/neg weights on a tree ⋮ Facility location problems with uncertainty on the plane ⋮ Capacitated multi-period maximal covering location problem with server uncertainty ⋮ Minmax regret solutions for minimax optimization problems with uncertainty

This page was built for publication: