We stand with Ukraine

We stand with Ukraine

Daniel Cosmin Porumbel

Orcid: 0000-0002-7478-3533

Affiliations:

Conservatoire National des Arts et Métiers (CNAM), Paris, France
University of Artois, Bethune, France (former)

According to our database¹, Daniel Cosmin Porumbel authored at least 29 papers between 2007 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

on orcid.org

On csauthors.net:

Bibliography

2024

Using an exact bi-objective decoder in a memetic algorithm for arc-routing (and other decoder-expressible) problems.

[BibT_eX]

[DOI]

Daniel Porumbel

,

Igor Machado Coelho

,

El-Ghazali Talbi

Eur. J. Oper. Res., February, 2024

2023

Semidefinite Programming by Projective Cutting Planes.

[BibT_eX]

[DOI]

Daniel Porumbel

CoRR, 2023

2022

Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems.

[BibT_eX]

[DOI]

Daniel Porumbel

INFORMS J. Comput., 2022

2020

Projective Cutting-Planes.

[BibT_eX]

[DOI]

Daniel Porumbel

SIAM J. Optim., 2020

Distance-guided local search.

[BibT_eX]

[DOI]

Daniel Porumbel

,

J. Heuristics, 2020

2018

Prize-collecting set multicovering with submodular pricing.

[BibT_eX]

[DOI]

Daniel Porumbel

Int. Trans. Oper. Res., 2018

The capacitated vehicle routing problem with evidential demands.

[BibT_eX]

[DOI]

,

Frédéric Pichon

,

Daniel Porumbel

,

,

Int. J. Approx. Reason., 2018

From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints.

[BibT_eX]

[DOI]

Daniel Porumbel

Discret. Optim., 2018

2017

Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems.

[BibT_eX]

[DOI]

Daniel Porumbel

,

François Clautiaux

INFORMS J. Comput., 2017

Iterated Local Search and Column Generation to solve Arc-Routing as a permutation set-covering problem.

[BibT_eX]

[DOI]

Daniel Porumbel

,

Gilles Goncalves

,

,

Eur. J. Oper. Res., 2017

A Recourse Approach for the Capacitated Vehicle Routing Problem with Evidential Demands.

[BibT_eX]

[DOI]

,

Frédéric Pichon

,

Daniel Porumbel

,

,

Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2017

2016

Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation.

[BibT_eX]

[DOI]

Daniel Porumbel

Math. Program., 2016

The Capacitated Vehicle Routing Problem with Evidential Demands: A Belief-Constrained Programming Approach.

[BibT_eX]

[DOI]

,

Frédéric Pichon

,

Daniel Porumbel

,

,

Proceedings of the Belief Functions: Theory and Applications, 2016

2015

Using dual feasible functions to construct fast lower bounds for routing and location problems.

[BibT_eX]

[DOI]

Daniel Cosmin Porumbel

,

Gilles Goncalves

Discret. Appl. Math., 2015

2014

Scoring-Based Neighborhood Dominance for the Subgraph Isomorphism Problem.

[BibT_eX]

[DOI]

Gilles Audemard

,

Christophe Lecoutre

,

Mouny Samy Modeliar

,

Gilles Goncalves

,

Daniel Cosmin Porumbel

Proceedings of the Principles and Practice of Constraint Programming, 2014

2013

Recent Advances in Graph Vertex Coloring.

[BibT_eX]

[DOI]

Philippe Galinier

,

Jean-Philippe Hamiez

,

,

Daniel Cosmin Porumbel

Proceedings of the Handbook of Optimization - From Classical to Modern Approach, 2013

Informed Reactive Tabu Search for Graph Coloring.

[BibT_eX]

[DOI]

Daniel Cosmin Porumbel

,

,

Asia Pac. J. Oper. Res., 2013

2012

Heuristic algorithms and learning techniques: applications to the graph coloring problem.

[BibT_eX]

[DOI]

Daniel Cosmin Porumbel

4OR, 2012

2011

Isomorphism Testing via Polynomial-Time Graph Extensions.

[BibT_eX]

[DOI]

Daniel Cosmin Porumbel

J. Math. Model. Algorithms, 2011

An efficient algorithm for computing the distance between close partitions.

[BibT_eX]

[DOI]

Daniel Cosmin Porumbel

,

,

Discret. Appl. Math., 2011

A simple and effective algorithm for the MaxMin diversity problem.

[BibT_eX]

[DOI]

Daniel Cosmin Porumbel

,

,

Ann. Oper. Res., 2011

Spacing memetic algorithms.

[BibT_eX]

[DOI]

Daniel Cosmin Porumbel

,

,

Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

2010

An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring.

[BibT_eX]

[DOI]

Daniel Cosmin Porumbel

,

,

Comput. Oper. Res., 2010

A search space "cartography" for guiding graph coloring heuristics.

[BibT_eX]

[DOI]

Daniel Cosmin Porumbel

,

,

Comput. Oper. Res., 2010

2009

Algorithmes Heuristiques et Techniques d'Apprentissage : Applications au Problème de Coloration de Graphe. (Heuristic Algorithms And Learning Techniques : Applications to the Graph Coloring Problem).

[BibT_eX]

[DOI]

Daniel Cosmin Porumbel

PhD thesis, 2009

A polynomial graph extension procedure for improving graph isomorphism algorithms

[BibT_eX]

[DOI]

Daniel Cosmin Porumbel

CoRR, 2009

Position-Guided Tabu Search Algorithm for the Graph Coloring Problem.

[BibT_eX]

[DOI]

Daniel Cosmin Porumbel

,

,

Proceedings of the Learning and Intelligent Optimization, Third International Conference, 2009

Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms.

[BibT_eX]

[DOI]

Daniel Cosmin Porumbel

,

,

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2009

2007

A Study of Evaluation Functions for the Graph K-Coloring Problem.

[BibT_eX]

[DOI]

Daniel Cosmin Porumbel

,

,

Proceedings of the Artificial Evolution, 2007

Loading...