Andreas Drexl

J. Sched., 2010

Round robin tournaments and three index assignments.

[BibT_eX]

[DOI]

Frits C. R. Spieksma

4OR, 2010

2009

A branch-and-price algorithm for scheduling sport leagues.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2009

Non-linear anonymous pricing combinatorial auctions.

[BibT_eX]

[DOI]

Kurt Jørnsten

Diether Knof

Eur. J. Oper. Res., 2009

A branching scheme for finding cost-minimal round robin tournaments.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2009

IP models for round robin tournaments.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2009

2008

Long-term staffing based on qualification profiles.

[BibT_eX]

[DOI]

Martin Mundschenk

Math. Methods Oper. Res., 2008

2007

Reflections about pseudo-dual prices in combinatorial auctions.

[BibT_eX]

[DOI]

Kurt Jørnsten

J. Oper. Res. Soc., 2007

2006

Algorithms for the car sequencing and the level scheduling problem.

[BibT_eX]

[DOI]

Lars Matthießen

J. Sched., 2006

Inventory-based dispatching of automated guided vehicles on container terminals.

[BibT_eX]

[DOI]

Sönke Hartmann

OR Spectr., 2006

Scheduling the professional soccer leagues of Austria and Germany.

[BibT_eX]

[DOI]

Thomas Bartsch

Stefan Kröger

Comput. Oper. Res., 2006

Branching Based on Home-Away-Pattern Sets.

[BibT_eX]

[DOI]

Proceedings of the Operations Research, 2006

2005

Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation.

[BibT_eX]

[DOI]

Andreas Klose

Manag. Sci., 2005

Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming.

[BibT_eX]

[DOI]

Can Akkan

J. Log. Algebraic Methods Program., 2005

Facility location models for distribution system design.

[BibT_eX]

[DOI]

Andreas Klose

Eur. J. Oper. Res., 2005

Network decomposition-based benchmark results for the discrete time-cost tradeoff problem.

[BibT_eX]

[DOI]

Can Akkan

Eur. J. Oper. Res., 2005

2001

Allocation of partially renewable resources: Concept, capabilities, and applications.

[BibT_eX]

[DOI]

Andreas Schirmer

Networks, 2001

Sequencing JIT Mixed-Model Assembly Lines Under Station-Load and Part-Usage Constraints.

[BibT_eX]

[DOI]

Manag. Sci., 2001

Optimization guided lower and upper bounds for the resource investment problem.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2001

2000

ProGen/pix - An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2000

1999

Resource-constrained project scheduling: Notation, classification, models, and methods.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 1999

1998

Proportional lot sizing and scheduling: Some extensions.

[BibT_eX]

[DOI]

Networks, 1998

Project scheduling with multiple modes: A comparison of exact algorithms.

[BibT_eX]

[DOI]

Sönke Hartmann

Networks, 1998

Adaptive Suchverfahren zur Projektplanung bei beschränkten Ressourcen.

[BibT_eX]

Künstliche Intell., 1998

Some insights into proportional lot sizing and scheduling.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 1998

Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm.

[BibT_eX]

[DOI]

Arno Sprecher

Eur. J. Oper. Res., 1998

1995

Book reviews.

[BibT_eX]

[DOI]

Eberhard Girlich

K.-H. Eger

Math. Methods Oper. Res., 1995

A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups.

[BibT_eX]

[DOI]

Carsten Jordan

INFORMS J. Comput., 1995

1990

Job-Prozessor-Scheduling für heterogene Computernetzwerke.

[BibT_eX]

Wirtschaftsinf., 1990

1988

A simulated annealing approach to the multiconstraint zero-one knapsack problem.

[BibT_eX]

[DOI]

Computing, 1988

1984

A comparative study of some discrete descent approaches in stratified sampling.

[BibT_eX]

[DOI]