scientific article
From MaRDI portal
Publication:3971521
zbMath0747.90058MaRDI QIDQ3971521
Arie Tamir, Antoon W. J. Kolen
Publication date: 25 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (38)
Efficient algorithms for the round-trip 1-center and 1-median problems ⋮ Covering part of a planar network ⋮ A framework for demand point and solution space aggregation analysis for location models ⋮ Reliability, covering and balanced matrices ⋮ A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices ⋮ Totally balanced and totally unimodular matrices defined by center location problems ⋮ Polyhedral properties of the \(K\)-median problem on a tree ⋮ Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs ⋮ Online clustering with variable sized clusters ⋮ On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph ⋮ The gradual covering decay location problem on a network. ⋮ Comparative error bound theory for three location models: continuous demand versus discrete demand ⋮ Voluntary formation of communities for the provision of public projects. ⋮ Location coverage models with demand originating from nodes and paths: Application to cellular network design ⋮ The maximin gradual cover location problem ⋮ An iterated local search for the budget constrained generalized maximal covering location problem ⋮ Improved complexity bounds for location problems on the real line ⋮ Competitive location in the plane ⋮ Covering a line segment with variable radius discs ⋮ Dominating set games. ⋮ Generalized coverage: new developments in covering location models ⋮ The generalized maximal covering location problem ⋮ Center location problems on tree graphs with subtree-shaped customers ⋮ On the core of network synthesis games ⋮ Improved algorithms for the multicut and multiflow problems in rooted trees ⋮ Aggregation error for location models: Survey and analysis ⋮ Locating flow-capturing units on a network with multi-counting and diminishing returns to scale ⋮ Traveling salesman games with the Monge property ⋮ The nestedness property of the convex ordered median location problem on a tree ⋮ Benders-and-cut algorithm for fixed-charge capacitated network design problem ⋮ One-way and round-trip center location problems ⋮ On a class of covering problems with variable capacities in wireless networks ⋮ A unifying location model on tree graphs based on submodularity property ⋮ On some optimization problems on \(k\)-trees and partial \(k\)-trees ⋮ On a cost allocation problem arising from a capacitated concentrator covering problem ⋮ Integer programming formulations of discrete hub location problems ⋮ The least element property of center location on tree networks with applications to distance and precedence constrained problems ⋮ An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure
This page was built for publication:
