default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlf Kimms
Person information
- affiliation: University of Duisburg-Essen, Duisburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j35]Mira Baude, Alf Kimms:
Modelling pandemic behavior with a network-SIRD approach. Central Eur. J. Oper. Res. 32(2): 521-541 (2024)- 2023
- [j34]Alf Kimms, Hédi Király
:
An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects. Eur. J. Oper. Res. 306(3): 1202-1218 (2023) - [j33]Alf Kimms, Fabian Wilschewski:
A new modeling approach for the unrestricted block relocation problem. OR Spectr. 45(4): 1071-1111 (2023) - 2021
- [j32]Alf Kimms:
The structure of the 3x + 1 problem. Electron. J. Graph Theory Appl. 9(1): 157-174 (2021) - 2020
- [j31]Dirk Briskorn, Alf Kimms, Denis Olschok:
Simultaneous planning for disaster road clearance and distribution of relief goods: a basic model and an exact solution method. OR Spectr. 42(3): 591-619 (2020) - 2018
- [j30]Alf Kimms, Marc Maiwald:
Bi-objective safe and resilient urban evacuation planning. Eur. J. Oper. Res. 269(3): 1122-1136 (2018) - [j29]Waldemar Grauberger, Alf Kimms:
Computing pure Nash equilibria in network revenue management games. OR Spectr. 40(2): 481-516 (2018) - 2016
- [j28]Waldemar Grauberger, Alf Kimms:
Airline revenue management games with simultaneous price and quantity competition. Comput. Oper. Res. 75: 64-75 (2016) - [j27]Alf Kimms, Kerstin Seekircher:
Network design to anticipate selfish evacuation routing. EURO J. Comput. Optim. 4(3-4): 271-298 (2016) - [j26]Alf Kimms, Igor Kozeletskyi:
Shapley value-based cost allocation in the cooperative traveling salesman problem under rolling horizon planning. EURO J. Transp. Logist. 5(4): 371-392 (2016) - [j25]Alf Kimms, Igor Kozeletskyi:
Core-based cost allocation in the cooperative traveling salesman problem. Eur. J. Oper. Res. 248(3): 910-916 (2016) - [j24]Alf Kimms, Herbert Kopfer:
Collaborative planning in transportation. OR Spectr. 38(1): 1-2 (2016) - 2014
- [j23]Waldemar Grauberger, Alf Kimms:
Computing approximate Nash equilibria in general network revenue management games. Eur. J. Oper. Res. 237(3): 1008-1020 (2014) - 2012
- [j22]Alf Kimms, Klaus-Christian Maassen, Susanne Pottbäcker:
Guiding traffic in the case of big events with spot checks on traffic and additional parking space requirements. Central Eur. J. Oper. Res. 20(4): 755-773 (2012) - [j21]S. Bretschneider, Alf Kimms:
Pattern-based evacuation planning for urban areas. Eur. J. Oper. Res. 216(1): 57-69 (2012) - [j20]Alf Kimms, Demet Çetiner:
Approximate nucleolus-based revenue sharing in airline alliances. Eur. J. Oper. Res. 220(2): 510-521 (2012) - [j19]Alf Kimms, Klaus-Christian Maassen:
Cell-transmission-based evacuation planning with rescue teams. J. Heuristics 18(3): 435-471 (2012) - [j18]Alf Kimms, Klaus-Christian Maassen:
A fast heuristic approach for large-scale cell-transmission-based evacuation route planning. Networks 60(3): 179-193 (2012) - 2011
- [j17]Michaela Graf, Alf Kimms:
An option-based revenue management procedure for strategic airline alliances. Eur. J. Oper. Res. 215(2): 459-469 (2011) - [j16]Alf Kimms, Klaus-Christian Maassen:
Optimization and simulation of traffic flows in the case of evacuating urban areas. OR Spectr. 33(3): 571-593 (2011) - 2010
- [j15]Julia Drechsel, Alf Kimms:
The subcoalition-perfect core of cooperative games. Ann. Oper. Res. 181(1): 591-601 (2010) - 2007
- [j14]Alf Kimms, Robert Klein:
Revenue management. OR Spectr. 29(1): 1-3 (2007) - [j13]Alf Kimms, Michael Müller-Bungart:
Simulation of stochastic demand data streams for network revenue management problems. OR Spectr. 29(1): 5-20 (2007) - 2006
- [j12]Andreas Drexl, Alf Kimms, Lars Matthießen:
Algorithms for the car sequencing and the level scheduling problem. J. Sched. 9(2): 153-176 (2006) - 2005
- [j11]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) - [j10]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) - 2004
- [j9]Alf Kimms:
Book reviews. OR Spectr. 26(1): 145 (2004) - 2003
- [j8]Alf Kimms:
Costing communication standards in information systems using a minimum cut approach. J. Oper. Res. Soc. 54(4): 426-431 (2003) - 2001
- [j7]Alf Kimms:
Maximizing the Net Present Value of a Project Under Resource Constraints Using a Lagrangian Relaxation Based Heuristic with Tight Upper Bounds. Ann. Oper. Res. 102(1-4): 221-236 (2001) - [j6]Andreas Drexl, Alf Kimms:
Optimization guided lower and upper bounds for the resource investment problem. J. Oper. Res. Soc. 52(3): 340-351 (2001) - [j5]Andreas Drexl, Alf Kimms:
Sequencing JIT Mixed-Model Assembly Lines Under Station-Load and Part-Usage Constraints. Manag. Sci. 47(3): 480-491 (2001) - 1999
- [j4]Alf Kimms:
A genetic algorithm for multi-level, multi-machine lot sizing and scheduling. Comput. Oper. Res. 26(8): 829-848 (1999) - 1998
- [j3]Alf Kimms, Andreas Drexl:
Some insights into proportional lot sizing and scheduling. J. Oper. Res. Soc. 49(11): 1196-1205 (1998) - [j2]Alf Kimms, Andreas Drexl:
Proportional lot sizing and scheduling: Some extensions. Networks 32(2): 85-101 (1998) - [j1]Alf Kimms:
Fallbasiertes Schließen auf Methoden zur Produktionsplanung. Wirtschaftsinf. 40(5): 417-423 (1998)
Conference and Workshop Papers
- 2007
- [c2]Julia Drechsel, Alf Kimms:
Berechnung von Kernelementen in Kooperativen Bestellmengen-Spielen. GI Jahrestagung (1) 2007: 79-86 - [c1]Claudio Fabiano Motta Toledo, Paulo Morelato França, Reinaldo Morabito, Alf Kimms:
Evolutionary Approaches to Solve an Integrated Lot Scheduling Problem in the Soft Drink Industry. HIS 2007: 95-100
Parts in Books or Collections
- 2008
- [p1]Deisemara Ferreira, Paulo Morelato França, Alf Kimms, Reinaldo Morabito, Socorro Rangel, Claudio Fabiano Motta Toledo:
Heuristics and meta-heuristics for lot sizing and scheduling in the soft drinks industry: a comparison study. Metaheuristics for Scheduling in Industrial and Manufacturing Applications 2008: 169-210
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 2024-09-28 01:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
