Approximation Algorithms for Capacitated Location Routing

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Bibliographic citation: Approximation Algorithms for Capacitated Location Routing ; 2010, 10
Preprint Reihe Mathematik ; 2010, 10

Classification: Mathematik

Creator: Harks, Tobias
König, Felix G.
Matuschke, Jannik

DOI: 10.14279/depositonce-14468

Handle: 11303/15695

URN: urn:nbn:de:101:1-2022011306542730122678

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 15.08.2025, 7:25 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Harks, Tobias
König, Felix G.
Matuschke, Jannik

Other Objects (12)

Approximation algorithms for facility location problems (lecture notes)

Approximation algorithms for some extensions of the maximum profit routing problem

Hochschulschrift

Algorithms and decomposition methods for multiobjective location and approximation problems

Approximation algorithms for connected facility location with buy-at-bulk edge costs

Approximation algorithms

zweidimensionales bewegtes Bild

Approximation Algorithms

Location Dynamic Tabu Routing Protocol for MANETs

Reality-Check for DTN Routing Algorithms

Routing algorithms for time sensitive networks

Hochschulschrift

Approximation algorithms for layout problems

Approximation algorithms for intersection graphs

Approximation algorithms for facility location problems (lecture notes)

Approximation algorithms for some extensions of the maximum profit routing problem

Hochschulschrift

Algorithms and decomposition methods for multiobjective location and approximation problems

Approximation algorithms for connected facility location with buy-at-bulk edge costs

Approximation algorithms

zweidimensionales bewegtes Bild

Approximation Algorithms

Location Dynamic Tabu Routing Protocol for MANETs

Reality-Check for DTN Routing Algorithms

Routing algorithms for time sensitive networks

Hochschulschrift

Approximation algorithms for layout problems

Approximation algorithms for intersection graphs

Approximation algorithms for facility location problems (lecture notes)

Approximation algorithms for some extensions of the maximum profit routing problem

Hochschulschrift

Algorithms and decomposition methods for multiobjective location and approximation problems

Approximation algorithms for connected facility location with buy-at-bulk edge costs

Approximation algorithms

zweidimensionales bewegtes Bild

Approximation Algorithms

Location Dynamic Tabu Routing Protocol for MANETs

Reality-Check for DTN Routing Algorithms

Routing algorithms for time sensitive networks

Hochschulschrift

Approximation algorithms for layout problems

Approximation algorithms for intersection graphs

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Approximation Algorithms for Capacitated Location Routing

Object Details

References and Relationships

Classification and Topics

Contributors, Places and Time

Further information

Data provider

Associated

Other Objects (12)

Approximation algorithms for facility location problems (lecture notes)

Approximation algorithms for some extensions of the maximum profit routing problem

Algorithms and decomposition methods for multiobjective location and approximation problems

Approximation algorithms for connected facility location with buy-at-bulk edge costs

Approximation algorithms

Approximation Algorithms

Approximation Algorithms

Location Dynamic Tabu Routing Protocol for MANETs

Reality-Check for DTN Routing Algorithms

Routing algorithms for time sensitive networks

Approximation algorithms for layout problems

Approximation algorithms for intersection graphs

Approximation algorithms for facility location problems (lecture notes)

Approximation algorithms for some extensions of the maximum profit routing problem

Algorithms and decomposition methods for multiobjective location and approximation problems

Approximation algorithms for connected facility location with buy-at-bulk edge costs

Approximation algorithms

Approximation Algorithms

Approximation Algorithms

Location Dynamic Tabu Routing Protocol for MANETs

Reality-Check for DTN Routing Algorithms

Routing algorithms for time sensitive networks

Approximation algorithms for layout problems

Approximation algorithms for intersection graphs

Approximation algorithms for facility location problems (lecture notes)

Approximation algorithms for some extensions of the maximum profit routing problem

Algorithms and decomposition methods for multiobjective location and approximation problems

Approximation algorithms for connected facility location with buy-at-bulk edge costs

Approximation algorithms

Approximation Algorithms

Approximation Algorithms

Location Dynamic Tabu Routing Protocol for MANETs

Reality-Check for DTN Routing Algorithms

Routing algorithms for time sensitive networks

Approximation algorithms for layout problems

Approximation algorithms for intersection graphs

Related objects

Reset password