Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: J Comb Optim

Search In Journal Title:

Abbravation: Journal of Combinatorial Optimization

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1007/s12032-013-0661-1

Search In DOI:

ISSN

1573-2886

Search In ISSN:
Search In Title Of Papers:

Median problems with positive and negative weights

Authors: Rainer E Burkard Johannes Hatzl
Publish Date: 2008/10/10
Volume: 20, Issue: 1, Pages: 27-46
PDF Link

Abstract

This paper deals with facility location problems on graphs with positive and negative vertex weights We consider two different objective functions In the first one MWD vertices with positive weight are assigned to the closest facility whereas vertices with negative weight are assigned to the farthest facility In the second one WMD all the vertices are assigned to the nearest facility For the MWD model it is shown that there exists a finite set of points in the graph which contains the locations of facilities in an optimal solution Furthermore algorithms for both models for the 2median problem on a cycle are developed The algorithm for the MWD model runs in linear time whereas the algorithm for the WMD model has a time complexity of  mathcalOn2

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. A Lagrangian bound for many-to-many assignment problems
  2. New bounds for the balloon popping problem
  3. An exact algorithm for the maximum probabilistic clique problem
  4. A two-stage method for member selection of emergency medical service
  5. Budget-constrained minimum cost flows
  6. On the complexity of partitioning a graph into a few connected subgraphs
  7. The unconstrained binary quadratic programming problem: a survey
  8. Multiple L ( j ,1)-labeling of the triangular lattice
  9. A hybrid algorithm based on variable neighbourhood for the strip packing problem
  10. Penalty guided genetic search for redundancy optimization in multi-state series-parallel power system
  11. Evaluation performance of genetic algorithm and tabu search algorithm for solving the Max-RWA problem in all-optical networks
  12. Modified differential evolution with self-adaptive parameters method
  13. Extremal polyomino chains with respect to general Randić index
  14. The weighted link ring loading problem
  15. A new recombination lower bound and the minimum perfect phylogenetic forest problem
  16. Optimization of loss-balanced multicast in all-optical WDM networks
  17. Reconfiguration of dominating sets
  18. Approximate event detection over multi-modal sensing data
  19. Mobile facility location: combinatorial filtering via weighted occupancy
  20. Bounded information dissemination in multi-channel wireless networks
  21. Total coloring of planar graphs without adjacent short cycles
  22. Disjunctive total domination in graphs
  23. A quadratic lower bound for colourful simplicial depth
Search Result: