Train Marshalling Problem - Algorithms and Bounds

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Bibliographic citation: Report in Wirtschaftsmathematik (WIMA Report) ; 132

Classification: Mathematik

Event: Veröffentlichung

(where): Kaiserslautern

(who): Technische Universität Kaiserslautern, Fachbereich Mathematik

(when): 2010

Creator: Beygang, Katharina
Krumke, Sven O.
Dahms, Florian

URN: urn:nbn:de:hbz:386-kluedo-16709

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

Last update: 15.08.2025, 7:37 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

Beygang, Katharina
Krumke, Sven O.
Dahms, Florian
Technische Universität Kaiserslautern, Fachbereich Mathematik

Time of origin

2010

Other Objects (12)

Branch and Bound Algorithms for the Bus Evacuation Problem

Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems

Hochschulschrift

Lower Bounds for Heuristic Algorithms

DLP in semigroups: Algorithms and lower bounds

Initialization of parallel branch-and-bound algorithms

Hochschulschrift

Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows

Branch and bound algorithms for the maximum clique problem under a unified framework

Hochschulschrift | Online-Publikation

Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows

Algorithms and Lower Bounds for Comparator Circuits from Shrinkage

Pareto Sums of Pareto Sets : Lower Bounds and Algorithms

Multi-robot task allocation problem with multiple nonlinear criteria using branch and bound and genetic algorithms

Hochschulschrift

New algorithms and lower bounds for sequential access data compression

Branch and Bound Algorithms for the Bus Evacuation Problem

Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems

Hochschulschrift

Lower Bounds for Heuristic Algorithms

DLP in semigroups: Algorithms and lower bounds

Initialization of parallel branch-and-bound algorithms

Hochschulschrift

Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows

Branch and bound algorithms for the maximum clique problem under a unified framework

Hochschulschrift | Online-Publikation

Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows

Algorithms and Lower Bounds for Comparator Circuits from Shrinkage

Pareto Sums of Pareto Sets : Lower Bounds and Algorithms

Multi-robot task allocation problem with multiple nonlinear criteria using branch and bound and genetic algorithms

Hochschulschrift

New algorithms and lower bounds for sequential access data compression

Branch and Bound Algorithms for the Bus Evacuation Problem

Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems

Hochschulschrift

Lower Bounds for Heuristic Algorithms

DLP in semigroups: Algorithms and lower bounds

Initialization of parallel branch-and-bound algorithms

Hochschulschrift

Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows

Branch and bound algorithms for the maximum clique problem under a unified framework

Hochschulschrift | Online-Publikation

Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows

Algorithms and Lower Bounds for Comparator Circuits from Shrinkage

Pareto Sums of Pareto Sets : Lower Bounds and Algorithms

Multi-robot task allocation problem with multiple nonlinear criteria using branch and bound and genetic algorithms

Hochschulschrift

New algorithms and lower bounds for sequential access data compression

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.

Train Marshalling Problem - Algorithms and Bounds

Object Details

References and Relationships

Classification and Topics

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

Branch and Bound Algorithms for the Bus Evacuation Problem

Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems

Lower Bounds for Heuristic Algorithms

DLP in semigroups: Algorithms and lower bounds

Initialization of parallel branch-and-bound algorithms

Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows

Branch and bound algorithms for the maximum clique problem under a unified framework

Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows

Algorithms and Lower Bounds for Comparator Circuits from Shrinkage

Pareto Sums of Pareto Sets : Lower Bounds and Algorithms

Multi-robot task allocation problem with multiple nonlinear criteria using branch and bound and genetic algorithms

New algorithms and lower bounds for sequential access data compression

Branch and Bound Algorithms for the Bus Evacuation Problem

Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems

Lower Bounds for Heuristic Algorithms

DLP in semigroups: Algorithms and lower bounds

Initialization of parallel branch-and-bound algorithms

Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows

Branch and bound algorithms for the maximum clique problem under a unified framework

Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows

Algorithms and Lower Bounds for Comparator Circuits from Shrinkage

Pareto Sums of Pareto Sets : Lower Bounds and Algorithms

Multi-robot task allocation problem with multiple nonlinear criteria using branch and bound and genetic algorithms

New algorithms and lower bounds for sequential access data compression

Branch and Bound Algorithms for the Bus Evacuation Problem

Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems

Lower Bounds for Heuristic Algorithms

DLP in semigroups: Algorithms and lower bounds

Initialization of parallel branch-and-bound algorithms

Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows

Branch and bound algorithms for the maximum clique problem under a unified framework

Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows

Algorithms and Lower Bounds for Comparator Circuits from Shrinkage

Pareto Sums of Pareto Sets : Lower Bounds and Algorithms

Multi-robot task allocation problem with multiple nonlinear criteria using branch and bound and genetic algorithms

New algorithms and lower bounds for sequential access data compression

Related objects

Reset password