Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Mathematics Subject Classification (1991): 90C11, 68M10  (1)
  • worst-case analysis  (1)
Source
Material
Years
Keywords
  • 1
    Electronic Resource
    Electronic Resource
    Strong inequalities for capacitated survivable network design problems (2000)
    Springer
    Mathematical programming 89 (2000), S. 127-147 
    Details
    ISSN: 1436-4646
    Keywords: Mathematics Subject Classification (1991): 90C11, 68M10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract. We present several classes of facet-defining inequalities to strengthen polyhedra arising as subsystems of network design problems with survivability constraints. These problems typically involve assigning capacities to a network with multicommodity demands, such that after a vertex- or edge-deletion at least some prescribed fraction of each demand can be routed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/PL00011390
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    A note on the prize collecting traveling salesman problem (1993)
    Springer
    Mathematical programming 59 (1993), S. 413-420 
    Details
    ISSN: 1436-4646
    Keywords: Linear programming ; prize collecting ; rounding fractional solutions ; traveling salesman problem ; worst-case analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We study the version of the prize collecting traveling salesman problem, where the objective is to find a tour that visits a subset of vertices such that the length of the tour plus the sum of penalties associated with vertices not in the tour is as small as possible. We present an approximation algorithm with constant bound. The algorithm is based on Christofides' algorithm for the traveling salesman problem as well as a method to round fractional solutions of a linear programming relaxation to integers, feasible for the original problem.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01581256
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...