I. Dumitrescu

发表

Polyhedral Results for the Pickup and Delivery Travelling Salesman Problem

I. Dumitrescu, 2008 .

Algorithms for the Weight Constrained Shortest Path Problem

I. Dumitrescu, N. Boland, 2001 .

A Multistage Stochastic Programming Approach to Open Pit Mine Production Scheduling with Uncertain Geology

I. Dumitrescu, G. Froyland, N. Boland, 2008 .

Violence, Performance, and Pedagogy in Ælfric Bata's Colloquies

I. Dumitrescu, 2011 .

Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming

I. Dumitrescu, G. Froyland, T. Kalinowski, 2016, Math. Program..

The Experience of Education in Anglo-Saxon Literature

I. Dumitrescu, 2018 .

Bede's Liberation Philology: Releasing the English Tongue

I. Dumitrescu, 2013, PMLA/Publications of the Modern Language Association of America.

Beautiful Suffering and the Culpable Narrator in Chaucer's Legend of Good Women

I. Dumitrescu, 2017 .

The martyred tongue: the legendaries of Prudentius and Theresa Hak Kyung Cha

I. Dumitrescu, 2017 .

‘Pas de Philologie’: On Playful Appropriation and the Anglo-Saxon Scholar

I. Dumitrescu, 2016 .

The Grammar of Pain in Ælfric Bata's Colloquies

I. Dumitrescu, 2009 .

Voices and Books in the English Renaissance: A New History of Reading by Jennifer Richards / Learning Languages in Early Modern England by John Gallagher

I. Dumitrescu, 2020 .

Combinations of Local Search and Exact Algorithms

Thomas Stützle, Irina Dumitrescu, T. Stützle, 2003, EvoWorkshops.

LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity

Ambros M. Gleixner, Natashia Boland, Gary Froyland, 2009, Comput. Oper. Res..

Accelerated label setting algorithms for the elementary resource constrained shortest path problem

Natashia Boland, Irina Dumitrescu, John Dethridge, 2006, Oper. Res. Lett..

The martyred tongue: the legendaries of Prudentius and Theresa Hak Kyung Cha

I. Dumitrescu, 2017, Postmedieval: A Journal of Medieval Cultural Studies.

The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm

Gilbert Laporte, Jean-François Cordeau, Stefan Ropke, 2009, Math. Program..

Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems

Thomas Stützle, Marco Chiarandini, Irina Dumitrescu, 2008, Hybrid Metaheuristics.

Improved preprocessing, labeling and scaling algorithms for the Weight‐Constrained Shortest Path Problem

Natashia Boland, Irina Dumitrescu, I. Dumitrescu, 2003, Networks.

Stochastic Local Search Algorithms for the Graph Colouring Problem Stochastic Local Search Algorithms for the Graph Colouring Problem

Thomas Stützle, Marco Chiarandini, Irina Dumitrescu, 2005 .

Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming

Natashia Boland, Gary Froyland, Thomas Kalinowski, 2016, Mathematical Programming.

Usage of Exact Algorithms to Enhance Stochastic Local Search Algorithms

Thomas Stützle, Irina Dumitrescu, T. Stützle, 2010, Matheuristics.

A survey of methods that combine local search and exact algorithms

Thomas Stützle, Irina Dumitrescu, T. Stützle, 2022 .

The Demon of Distraction

I. Dumitrescu, Caleb Smith, 2021, Critical Inquiry.

Engineering resilient information systems for emergency management

Christian Vecchiola, Rahil Garnavi, Jürg von Känel, 2013, IBM J. Res. Dev..

An exact approach for tactical planning and patient selection for elective surgeries

Irvin Lustig, Olivia J. Smith, Hamideh Anjomshoa, 2018, Eur. J. Oper. Res..

A Comparison Between ACO Algorithms for the Set Covering Problem

Thomas Stützle, Irina Dumitrescu, Lucas Lessing, 2004, ANTS Workshop.

Constrained path and cycle problems

Irina Dumitrescu, I. Dumitrescu, 2002 .