sign in · help · news · about ·

BibSonomy :: author :: Raidl ::

tag user group author concept BibTeX key search:all

The blue social bookmark and publication sharing system.

>
|
<

bookmarks

bookmarks per page: 5 10 20 50 100

RSS BibTeX RDF more

publications

(85)

<< < 1 | 2 | 3 > >>

Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location.
Markus Leitner, and Günther R. Raidl EUROCAST 1, volume 6927 of Lecture Notes in Computer Science, page 295-302. Springer, (2011)
to dblp by dblp on Feb 1, 2012, 12:00 AM
URL | BibTeX
An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem.
Bin Hu, and Günther R. Raidl EUROCAST 1, volume 6927 of Lecture Notes in Computer Science, page 287-294. Springer, (2011)
to dblp by dblp on Feb 1, 2012, 12:00 AM
URL | BibTeX
Automatic Generation of 2-AntWars Players with Genetic Programming.
Johannes Inführ, and Günther R. Raidl EUROCAST 1, volume 6927 of Lecture Notes in Computer Science, page 248-255. Springer, (2011)
to dblp by dblp on Feb 1, 2012, 12:00 AM
URL | BibTeX
Improved Packing and Routing of Vehicles with Compartments.
Sandro Pirkwieser, Günther R. Raidl, and Jens Gottlieb EUROCAST 1, volume 6927 of Lecture Notes in Computer Science, page 392-399. Springer, (2011)
to dblp by dblp on Feb 1, 2012, 12:00 AM
URL | BibTeX
A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem.
Mario Ruthmair, and Günther R. Raidl EUROCAST 1, volume 6927 of Lecture Notes in Computer Science, page 351-358. Springer, (2011)
to dblp by dblp on Feb 1, 2012, 12:00 AM
URL | BibTeX
A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem.
Martin Berlakovich, Mario Ruthmair, and Günther R. Raidl EUROCAST 1, volume 6927 of Lecture Notes in Computer Science, page 256-263. Springer, (2011)
to dblp by dblp on Feb 1, 2012, 12:00 AM
URL | BibTeX
MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics.
Jakob Puchinger, Günther R. Raidl, and Sandro Pirkwieser Matheuristics, volume 10 of Annals of Information Systems, Springer, (2010)
to dblp by dblp on Dec 12, 2011, 12:00 AM
URL | BibTeX
Meta-Heuristic Separation of Jump Cuts in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem.
Martin Gruber, and Günther R. Raidl Matheuristics, volume 10 of Annals of Information Systems, Springer, (2010)
to dblp by dblp on Dec 12, 2011, 12:00 AM
URL | BibTeX
Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques.
Andreas M. Chwatal, and Günther R. Raidl Adv. Operations Research (2011)
to dblp by dblp on Dec 9, 2011, 12:00 AM
URL | BibTeX
A Branch-and-Cut-and-Price Algorithm for a Fingerprint-Template Compression Application.
Andreas M. Chwatal, Corinna Thöni, Karin Oberlechner, and Günther R. Raidl FedCSIS, page 239-246. (2011)
to dblp by dblp on Nov 10, 2011, 12:00 AM
URL | BibTeX
Edge sets: an effective evolutionary coding of spanning trees.
Günther R. Raidl, and Bryant A. Julstrom IEEE Trans. Evolutionary Computation 7(3):225-239 (2003)
to dblp by dblp on Oct 31, 2011, 12:00 AM
URL | BibTeX
Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints.
Johannes Inführ, and Günther R. Raidl INOC, volume 6701 of Lecture Notes in Computer Science, page 105-117. Springer, (2011)
to dblp by dblp on Sep 9, 2011, 12:00 AM
URL | BibTeX
Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem.
Markus Leitner, Mario Ruthmair, and Günther R. Raidl INOC, volume 6701 of Lecture Notes in Computer Science, page 124-138. Springer, (2011)
to dblp by dblp on Sep 9, 2011, 12:00 AM
URL | BibTeX
A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems.
Mario Ruthmair, and Günther R. Raidl IPCO, volume 6655 of Lecture Notes in Computer Science, page 376-388. Springer, (2011)
to dblp by dblp on Aug 23, 2011, 12:00 AM
URL | BibTeX
Branch-and-Cut-and-Price for Capacitated Connected Facility Location.
Markus Leitner, and Günther R. Raidl J. Math. Model. Algorithms 10(3):245-267 (2011)
to dblp by dblp on Aug 22, 2011, 12:00 AM
URL | BibTeX
An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing.
Jakob Puchinger, and Günther R. Raidl PPSN, volume 3242 of Lecture Notes in Computer Science, page 642-651. Springer, (2004)
to dblp by dblp on Aug 10, 2011, 12:00 AM
URL | BibTeX
An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem.
Gabriele Koller, and Günther R. Raidl PPSN, volume 3242 of Lecture Notes in Computer Science, page 302-311. Springer, (2004)
to dblp by dblp on Aug 10, 2011, 12:00 AM
URL | BibTeX
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem.
Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra Mutzel, Philipp Neuner, Ulrich Pferschy, Günther R. Raidl, and René Weiskircher GECCO 1, volume 3102 of Lecture Notes in Computer Science, page 1304-1315. Springer, (2004)
to dblp by dblp on Jul 7, 2011, 12:00 AM
URL | BibTeX
Solving a Real-World Glass Cutting Problem.
Jakob Puchinger, Günther R. Raidl, and Gabriele Koller EvoCOP, volume 3004 of Lecture Notes in Computer Science, page 165-176. Springer, (2004)
to dblp by dblp on Jul 6, 2011, 12:00 AM
URL | BibTeX
On Weight-Biased Mutation for Graph Problems.
Günther R. Raidl, Gabriele Kodydek, and Bryant A. Julstrom PPSN, volume 2439 of Lecture Notes in Computer Science, page 204-213. Springer, (2002)
to dblp by dblp on Jul 4, 2011, 12:00 AM
URL | BibTeX

<< < 1 | 2 | 3 > >>publications per page: 5 10 20 50 100