Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
From MaRDI portal
Publication:3883859
DOI10.1287/opre.28.4.847zbMath0441.90027OpenAlexW1970157749MaRDI QIDQ3883859
Cornuéjols, Gérard, Nemhauser, George I., Laurence A. Wolsey
Publication date: 1980
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.28.4.847
Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Inventory, storage, reservoirs (90B05)
Related Items
A Canonical Representation of Simple Plant Location Problems and Its Applications, Unnamed Item, Unnamed Item, The maximum vertex coverage problem on bipartite graphs, Measuring the impact of MVC attack in large complex networks, On nonlinear multi-covering problems, Product line selection and pricing analysis: impact of genetic relaxations, Phylogenetic diversity and the maximum coverage problem, Meaningfulness of conclusions from combinatorial optimization, The simple plant location problem: Survey and synthesis, On interval and circular-arc covering problems, The asymptotic probabilistic behaviour of quadratic sum assignment problems, On approximation of max-vertex-cover, Improved approximation of maximum vertex cover, A Probabilistic Analysis of the K-Location Problem
