Остановите войну!
for scientists:
default search action
Andreas Drexl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
- [j30]Dirk Briskorn, Andreas Drexl, Frits C. R. Spieksma:
Round robin tournaments and three index assignments. 4OR 8(4): 365-374 (2010) - [j29]Yury Nikulin, Andreas Drexl:
Theoretical aspects of multicriteria flight gate scheduling: deterministic and fuzzy models. J. Sched. 13(3): 261-280 (2010)
2000 – 2009
- 2009
- [j28]Dirk Briskorn, Andreas Drexl:
IP models for round robin tournaments. Comput. Oper. Res. 36(3): 837-852 (2009) - [j27]Dirk Briskorn, Andreas Drexl:
A branching scheme for finding cost-minimal round robin tournaments. Eur. J. Oper. Res. 197(1): 68-76 (2009) - [j26]Andreas Drexl, Kurt Jørnsten, Diether Knof:
Non-linear anonymous pricing combinatorial auctions. Eur. J. Oper. Res. 199(1): 296-302 (2009) - [j25]Dirk Briskorn, Andreas Drexl:
A branch-and-price algorithm for scheduling sport leagues. J. Oper. Res. Soc. 60(1): 84-93 (2009) - 2008
- [j24]Andreas Drexl, Martin Mundschenk:
Long-term staffing based on qualification profiles. Math. Methods Oper. Res. 68(1): 21-47 (2008) - 2007
- [j23]Andreas Drexl, Kurt Jørnsten:
Reflections about pseudo-dual prices in combinatorial auctions. J. Oper. Res. Soc. 58(12): 1652-1659 (2007) - 2006
- [j22]Thomas Bartsch, Andreas Drexl, Stefan Kröger:
Scheduling the professional soccer leagues of Austria and Germany. Comput. Oper. Res. 33: 1907-1937 (2006) - [j21]Dirk Briskorn, Andreas Drexl, Sönke Hartmann:
Inventory-based dispatching of automated guided vehicles on container terminals. OR Spectr. 28(4): 611-630 (2006) - [j20]Andreas Drexl, Alf Kimms, Lars Matthießen:
Algorithms for the car sequencing and the level scheduling problem. J. Sched. 9(2): 153-176 (2006) - [c1]Dirk Briskorn, Andreas Drexl:
Branching Based on Home-Away-Pattern Sets. OR 2006: 523-528 - 2005
- [j19]Andreas Klose, Andreas Drexl:
Facility location models for distribution system design. Eur. J. Oper. Res. 162(1): 4-29 (2005) - [j18]Can Akkan, Andreas Drexl, Alf Kimms:
Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. Eur. J. Oper. Res. 165(2): 339-358 (2005) - [j17]Can Akkan, Andreas Drexl, Alf Kimms:
Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming. J. Log. Algebraic Methods Program. 62(1): 1-39 (2005) - [j16]Andreas Klose, Andreas Drexl:
Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation. Manag. Sci. 51(11): 1689-1705 (2005) - 2001
- [j15]Andreas Drexl, Alf Kimms:
Optimization guided lower and upper bounds for the resource investment problem. J. Oper. Res. Soc. 52(3): 340-351 (2001) - [j14]Andreas Drexl, Alf Kimms:
Sequencing JIT Mixed-Model Assembly Lines Under Station-Load and Part-Usage Constraints. Manag. Sci. 47(3): 480-491 (2001) - [j13]Andreas Schirmer, Andreas Drexl:
Allocation of partially renewable resources: Concept, capabilities, and applications. Networks 37(1): 21-34 (2001) - 2000
- [j12]Andreas Drexl, Rüdiger Nissen, James H. Patterson, Frank Salewski:
ProGen/pix - An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions. Eur. J. Oper. Res. 125(1): 59-72 (2000)
1990 – 1999
- 1999
- [j11]Peter Brucker, Andreas Drexl, Rolf H. Möhring, Klaus Neumann, Erwin Pesch:
Resource-constrained project scheduling: Notation, classification, models, and methods. Eur. J. Oper. Res. 112(1): 3-41 (1999) - 1998
- [j10]Arno Sprecher, Andreas Drexl:
Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm. Eur. J. Oper. Res. 107(2): 431-450 (1998) - [j9]Alf Kimms, Andreas Drexl:
Some insights into proportional lot sizing and scheduling. J. Oper. Res. Soc. 49(11): 1196-1205 (1998) - [j8]Ulrich Dorndorf, Andreas Drexl, Erwin Pesch, Toàn Phan Huy:
Adaptive Suchverfahren zur Projektplanung bei beschränkten Ressourcen. Künstliche Intell. 12(4): 25-32 (1998) - [j7]Alf Kimms, Andreas Drexl:
Proportional lot sizing and scheduling: Some extensions. Networks 32(2): 85-101 (1998) - [j6]Sönke Hartmann, Andreas Drexl:
Project scheduling with multiple modes: A comparison of exact algorithms. Networks 32(4): 283-297 (1998) - 1995
- [j5]Carsten Jordan, Andreas Drexl:
A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups. INFORMS J. Comput. 7(2): 160-165 (1995) - [j4]Andreas Drexl, Eberhard Girlich, K.-H. Eger:
Book reviews. Math. Methods Oper. Res. 41(1): 121-124 (1995) - 1990
- [j3]Andreas Drexl:
Job-Prozessor-Scheduling für heterogene Computernetzwerke. Wirtschaftsinf. 32(4): 345-351 (1990)
1980 – 1989
- 1988
- [j2]Andreas Drexl:
A simulated annealing approach to the multiconstraint zero-one knapsack problem. Computing 40(1): 1-8 (1988) - 1984
- [j1]Andreas Drexl:
A comparative study of some discrete descent approaches in stratified sampling. Z. Oper. Research 28(8) (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-27 22:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint