Daniel Cosmin Porumbel

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Using quadratic cuts to iteratively strengthen convexifications of box quadratic programs Journal of Global Optimization	2026-03-31	Paper
Using an exact bi-objective decoder in a memetic algorithm for arc-routing (and other decoder-expressible) problems European Journal of Operational Research	2023-11-15	Paper
Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems INFORMS Journal on Computing	2022-12-01	Paper
Demystifying the characterization of SDP matrices in mathematical programming	2022-10-24	Paper
Projective cutting-planes SIAM Journal on Optimization	2020-03-27	Paper
Prize‐collecting set multicovering with submodular pricing International Transactions in Operational Research	2018-09-14	Paper
From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints Discrete Optimization	2018-08-20	Paper
The capacitated vehicle routing problem with evidential demands: a belief-constrained programming approach	2018-07-06	Paper
The capacitated vehicle routing problem with evidential demands International Journal of Approximate Reasoning	2018-06-15	Paper
Iterated local search and column generation to solve arc-routing as a permutation set-covering problem European Journal of Operational Research	2018-05-24	Paper
A recourse approach for the capacitated vehicle routing problem with evidential demands	2017-09-05	Paper
Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems INFORMS Journal on Computing	2017-06-02	Paper
Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation Mathematical Programming. Series A. Series B	2016-02-23	Paper
Using dual feasible functions to construct fast lower bounds for routing and location problems Discrete Applied Mathematics	2015-09-30	Paper
Informed reactive tabu search for graph coloring Asia-Pacific Journal of Operational Research	2013-10-21	Paper
Heuristic algorithms and learning techniques: applications to the graph coloring problem 4OR	2013-02-18	Paper
Isomorphism testing via polynomial-time graph extensions JMMA. Journal of Mathematical Modelling and Algorithms	2012-02-21	Paper
A simple and effective algorithm for the MaxMin diversity problem Annals of Operations Research	2011-11-17	Paper
An efficient algorithm for computing the distance between close partitions Discrete Applied Mathematics	2011-01-14	Paper
An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring Computers & Operations Research	2010-06-11	Paper
A search space ``cartography'' for guiding graph coloring heuristics Computers & Operations Research	2009-11-27	Paper

Research outcomes over time

This page was built for person: Daniel Cosmin Porumbel