default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIrina Dumitrescu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j7]Hamideh Anjomshoa, Irina Dumitrescu, Irvin Lustig
, Olivia J. Smith:
An exact approach for tactical planning and patient selection for elective surgeries. Eur. J. Oper. Res. 268(2): 728-739 (2018)- [p3]Marco Chiarandini, Irina Dumitrescu, Thomas Stützle:
Stochastic Local Search Algorithms for the Graph Colouring Problem. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - 2016
- [j6]Natashia Boland, Irina Dumitrescu, Gary Froyland, Thomas Kalinowski:
Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming. Math. Program. 157(1): 69-93 (2016) - 2013
- [j5]Christian Vecchiola, Hamideh Anjomshoa, Y. Bernstein, Irina Dumitrescu, Rahil Garnavi, Jürg von Känel, Glenn R. Wightwick:
Engineering resilient information systems for emergency management. IBM J. Res. Dev. 57(5) (2013) - 2010
- [j4]Irina Dumitrescu, Stefan Ropke, Jean-François Cordeau, Gilbert Laporte:
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm. Math. Program. 121(2): 269-305 (2010) - [p2]Irina Dumitrescu, Thomas Stützle:
Usage of Exact Algorithms to Enhance Stochastic Local Search Algorithms. Matheuristics 2010: 103-134
2000 – 2009
- 2009
- [j3]Natashia Boland, Irina Dumitrescu, Gary Froyland, Ambros M. Gleixner:
LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity. Comput. Oper. Res. 36(4): 1064-1089 (2009) - 2008
- [p1]Marco Chiarandini, Irina Dumitrescu, Thomas Stützle:
Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems. Hybrid Metaheuristics 2008: 117-150 - 2007
- [r1]Thomas Stützle, Irina Dumitrescu, Marco Chiarandini:
Stochastic Local Search Algorithms for the Graph Coloring Problem. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j2]Natashia Boland, John Dethridge, Irina Dumitrescu:
Accelerated label setting algorithms for the elementary resource constrained shortest path problem. Oper. Res. Lett. 34(1): 58-68 (2006) - 2004
- [c2]Lucas Lessing, Irina Dumitrescu, Thomas Stützle:
A Comparison Between ACO Algorithms for the Set Covering Problem. ANTS Workshop 2004: 1-12 - 2003
- [j1]Irina Dumitrescu, Natashia Boland:
Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem. Networks 42(3): 135-153 (2003) - [c1]Irina Dumitrescu, Thomas Stützle:
Combinations of Local Search and Exact Algorithms. EvoWorkshops 2003: 211-223
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-04-24 23:19 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:
